Fastest Mixing Markov Chain on a Graph
SIAM Review
Communication constraints in the average consensus problem
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
SIAM Journal on Control and Optimization
Automatica (Journal of IFAC)
Brief paper: Stochastic consensus seeking with communication delays
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Journal of Intelligent and Robotic Systems
Automation and Remote Control
Continuous-time and sampled-data-based average consensus with logarithmic quantizers
Automatica (Journal of IFAC)
Hi-index | 22.15 |
In this paper, average-consensus control is considered for networks of continuous-time integrator agents under fixed and directed topologies. The control input of each agent can only use its local state and the states of its neighbors corrupted by white noises. To attenuate the measurement noises, time-varying consensus gains are introduced in the consensus protocol. By combining the tools of algebraic graph theory and stochastic analysis, the convergence of these kinds of protocols is analyzed. Firstly, for noise-free cases, necessary and sufficient conditions are given on the network topology and consensus gains to achieve average-consensus. Secondly, for the cases with measurement noises, necessary and sufficient conditions are given on the consensus gains to achieve asymptotic unbiased mean square average-consensus. It is shown that under the protocol designed, all agents' states converge to a common Gaussian random variable, whose mathematical expectation is just the average of the initial states.