Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events

Authors:
Ming Cao;A. Stephen Morse;Brian D. O. Anderson
Affiliations:
-;-;-
Venue:
SIAM Journal on Control and Optimization
Year:
2008

Citing 0
Cited 13

Brief paper: Convergence speed in distributed consensus over dynamically switching random networks

Automatica (Journal of IFAC)
Gradient clock synchronization in wireless sensor networks

IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Decentralized robust adaptive control for the multiagent system consensus problem using neural networks

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Characterizing convergence speed for consensus seeking over dynamically switching directed random networks

ACC'09 Proceedings of the 2009 conference on American Control Conference
Distributed consensus for multi-agent systems with delays and noises in transmission channels

Automatica (Journal of IFAC)
Synchronization of multi-agent systems with delayed control input information from neighbors

Automatica (Journal of IFAC)
Brief paper: Stochastic consensus seeking with communication delays

Automatica (Journal of IFAC)
Consensus in Networks of Multiagents with Switching Topologies Modeled as Adapted Stochastic Processes

SIAM Journal on Control and Optimization
Convergence Speed in Distributed Consensus and Averaging

SIAM Review
Consensus of multiple second-order vehicles with a time-varying reference signal under directed topology

Automatica (Journal of IFAC)
Distributed Consensus for Multiagent Systems with Communication Delays and Limited Data Rate

SIAM Journal on Control and Optimization
Randomized optimal consensus of multi-agent systems

Automatica (Journal of IFAC)
Consensus of discrete-time multi-agent systems with transmission nonlinearity

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper uses recently established properties of compositions of directed graphs together with results from the theory of nonhomogeneous Markov chains to derive worst case convergence rates for the headings of a group of mobile autonomous agents which arise in connection with the widely studied Vicsek consensus problem. The paper also uses graph-theoretic constructions to solve modified versions of the Vicsek problem in which there are measurement delays, asynchronous events, or a group leader. In all three cases the conditions under which consensus is achieved prove to be almost the same as the conditions under which consensus is achieved in the synchronous, delay-free, leaderless case.