Rate of convergence for consensus with delays

Pierre Alexander Bliman, Angelia Nedić, Asuman Ozdaglar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely studied consensus algorithm, in which every agent forms a weighted average of its own value with the values received from its neighboring agents. We study an asynchronous operation of this algorithm using delayed agent values. Our focus is on establishing convergence rate results for this algorithm. In particular, for general network topologies, we provide a bound on the time required to reach consensus, which is an explicit function of the system parameters including the delay bound and the bound on agents' intercommunication intervals.

Original languageEnglish (US)
Title of host publicationProceedings of the 47th IEEE Conference on Decision and Control, CDC 2008
Pages4849-4854
Number of pages6
DOIs
StatePublished - Dec 1 2008
Event47th IEEE Conference on Decision and Control, CDC 2008 - Cancun, Mexico
Duration: Dec 9 2008Dec 11 2008

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other47th IEEE Conference on Decision and Control, CDC 2008
CountryMexico
CityCancun
Period12/9/0812/11/08

    Fingerprint

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Bliman, P. A., Nedić, A., & Ozdaglar, A. (2008). Rate of convergence for consensus with delays. In Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008 (pp. 4849-4854). [4738941] (Proceedings of the IEEE Conference on Decision and Control). https://doi.org/10.1109/CDC.2008.4738941