Convergence rate for consensus with delays

Angelia Nedich, Asuman Ozdaglar

Research output: Contribution to journalArticle

80 Citations (Scopus)

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 at each time step, every agent forms a weighted average of its own value with values received from the 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, we first show convergence to consensus under a bounded delay condition and some connectivity and intercommunication conditions imposed on the multi-agent system. We then provide a bound on the time required to reach the consensus. Our bound is given as an explicit function of the system parameters including the delay bound and the bound on agents' intercommunication intervals.

Original languageEnglish (US)
Pages (from-to)437-456
Number of pages20
JournalJournal of Global Optimization
Volume47
Issue number3
DOIs
StatePublished - Jul 2010
Externally publishedYes

Fingerprint

Convergence Rate
Connectivity
Weighted Average
Multi agent systems
Multi-agent Systems
Distributed Systems
Time-varying
Convergence rate
Interval

Keywords

  • Asynchronous
  • Convergence
  • Delays
  • Distributed consensus

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Applied Mathematics
  • Management Science and Operations Research

Cite this

Convergence rate for consensus with delays. / Nedich, Angelia; Ozdaglar, Asuman.

In: Journal of Global Optimization, Vol. 47, No. 3, 07.2010, p. 437-456.

Research output: Contribution to journalArticle

Nedich, Angelia ; Ozdaglar, Asuman. / Convergence rate for consensus with delays. In: Journal of Global Optimization. 2010 ; Vol. 47, No. 3. pp. 437-456.
@article{f5cb51a92ad941ee9871a157533fa964,
title = "Convergence rate for consensus with delays",
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 at each time step, every agent forms a weighted average of its own value with values received from the 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, we first show convergence to consensus under a bounded delay condition and some connectivity and intercommunication conditions imposed on the multi-agent system. We then provide a bound on the time required to reach the consensus. Our bound is given as an explicit function of the system parameters including the delay bound and the bound on agents' intercommunication intervals.",
keywords = "Asynchronous, Convergence, Delays, Distributed consensus",
author = "Angelia Nedich and Asuman Ozdaglar",
year = "2010",
month = "7",
doi = "10.1007/s10898-008-9370-2",
language = "English (US)",
volume = "47",
pages = "437--456",
journal = "Journal of Global Optimization",
issn = "0925-5001",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Convergence rate for consensus with delays

AU - Nedich, Angelia

AU - Ozdaglar, Asuman

PY - 2010/7

Y1 - 2010/7

N2 - 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 at each time step, every agent forms a weighted average of its own value with values received from the 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, we first show convergence to consensus under a bounded delay condition and some connectivity and intercommunication conditions imposed on the multi-agent system. We then provide a bound on the time required to reach the consensus. Our bound is given as an explicit function of the system parameters including the delay bound and the bound on agents' intercommunication intervals.

AB - 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 at each time step, every agent forms a weighted average of its own value with values received from the 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, we first show convergence to consensus under a bounded delay condition and some connectivity and intercommunication conditions imposed on the multi-agent system. We then provide a bound on the time required to reach the consensus. Our bound is given as an explicit function of the system parameters including the delay bound and the bound on agents' intercommunication intervals.

KW - Asynchronous

KW - Convergence

KW - Delays

KW - Distributed consensus

UR - http://www.scopus.com/inward/record.url?scp=77954759733&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954759733&partnerID=8YFLogxK

U2 - 10.1007/s10898-008-9370-2

DO - 10.1007/s10898-008-9370-2

M3 - Article

AN - SCOPUS:77954759733

VL - 47

SP - 437

EP - 456

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 3

ER -