Distributed Identification of Stable Large-Scale Isomorphic Nonlinear Networks Using Partial Observations

Distributed parameter identification for large-scale multi-agent networks encounters challenges due to nonlinear dynamics and partial observations. Simultaneously, ensuring the stability is crucial for the robust identification of dynamic networks, especially under data and model uncertainties. To handle these challenges, this paper proposes a particle consensus-based expectation maximization (EM) algorithm. The E-step proposes a distributed particle filtering approach, using local observations from agents to yield global consensus state estimates. The M-step constructs a likelihood function with an a priori contraction-stabilization constraint for the parameter estimation of isomorphic agents. Performance analysis and simulation results of the proposed method confirm its effectiveness in identifying parameters for stable nonlinear networks

Estimating Signal Timing of Actuated Signal Control Using Pattern Recognition under Connected Vehicle Environment

The Signal Phase and Timing (SPaT) message is an important input for research and applications of Connected Vehicles (CVs). However, the actuated signal controllers are not able to directly give the SPaT information since the SPaT is influenced by both signal control logic and real-time traffic demand. This study elaborates an estimation method which is proposed according to the idea that an actuated signal controller would provide similar signal timing for similar traffic states. Thus, the quantitative description of traffic states is important. The traffic flow at each approaching lane has been compared to fluids. The state of fluids can be indicated by state parameters, e.g. speed or height, and its energy, which includes kinetic energy and potential energy. Similar to the fluids, this paper has proposed an energy model for traffic flow, and it has also added the queue length as an additional state parameter. Based on that, the traffic state of intersections can be descripted. Then, a pattern recognition algorithm was developed to identify the most similar historical states and also their corresponding SPaTs, whose average is the estimated SPaT of this second. The result shows that the average error is 3.1 seconds