Convergence in Multiagent Coordination, Consensus, and Flocking

We discuss an old distributed algorithm for reaching 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...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 44th IEEE Conference on Decision and Control pp. 2996 - 3000
Main Authors Blondel, V.D., Hendrickx, J.M., Olshevsky, A., Tsitsiklis, J.N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Aggregates
Algorithm design and analysis
Contracts
Convergence
Delay
Distributed algorithms
Fellows
Motion estimation
Statistical distributions
Vehicles
Online AccessGet full text

Cover

More Information
Summary:We discuss an old distributed algorithm for reaching 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.
ISBN:9780780395671
0780395670
ISSN:0191-2216
DOI:10.1109/CDC.2005.1582620