Decentralised minimum-time average consensus in digraphs

Themistoklis Charalambous, Ye Yuan, Tao Yang, Wei Pan, Christoforos N. Hadjicostis, Michael Johansson

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

6 Citations (Scopus)

Abstract

Distributed algorithms for average consensus in directed graphs are typically asymptotic in the literature. In this work, we propose a protocol to distributively reach average consensus in a finite number of steps on interconnection topologies that form strongly connected directed graphs (digraphs). The average consensus value can be computed, based exclusively on local observations at each component, by running a protocol that requires each component to observe and store its own value over a finite and minimal number of steps, and to have knowledge of the number of its out-going links (i.e., the number of components to which it sends information). The proposed algorithm is demonstrated via illustrative examples.

Original languageEnglish
Title of host publication2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013
PublisherIEEE
Pages2617-2622
Number of pages6
ISBN (Print)9781467357173
DOIs
Publication statusPublished - 2013
MoE publication typeA4 Article in a conference publication
EventIEEE Conference on Decision and Control - Florence, Italy
Duration: 10 Dec 201313 Dec 2013
Conference number: 52

Conference

ConferenceIEEE Conference on Decision and Control
Abbreviated titleCDC
Country/TerritoryItaly
CityFlorence
Period10/12/201313/12/2013

Fingerprint

Dive into the research topics of 'Decentralised minimum-time average consensus in digraphs'. Together they form a unique fingerprint.

Cite this