Convergence in Multiagent Coordination, Consensus, and Flocking
Top Cited Papers
- 4 October 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We discuss an old distributed algorithm for reach- ing consensus that has received a fair amount of recent attention. In this algorithm, a number of agents exchange their values asynchronously and form weighted averages with (possibly outdated) values possessed by their neighbors. We overview existing convergence results, and establish some new ones, for the case of unbounded intercommunication intervals.Keywords
This publication has 10 references indexed in Scilit:
- Consensus PropagationIEEE Transactions on Information Theory, 2006
- Extension of a result by Moreau on stability of leaderless multi-agent systems.Published by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Gossip algorithms: design, analysis and applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Stability of multiagent systems with time-dependent communication linksIEEE Transactions on Automatic Control, 2005
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Coordination of groups of mobile autonomous agents using nearest neighbor rulesIEEE Transactions on Automatic Control, 2003
- Novel Type of Phase Transition in a System of Self-Driven ParticlesPhysical Review Letters, 1995
- Dynamic load balancing for distributed memory multiprocessorsJournal of Parallel and Distributed Computing, 1989
- Distributed asynchronous deterministic and stochastic gradient optimization algorithmsIEEE Transactions on Automatic Control, 1986
- Products of Indecomposable, Aperiodic, Stochastic MatricesProceedings of the American Mathematical Society, 1963