Decentralised minimum-time average consensus in digraphs

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

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference contributionScientificvertaisarvioitu

6 Sitaatiot (Scopus)

Abstrakti

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.

AlkuperäiskieliEnglanti
Otsikko2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013
KustantajaIEEE
Sivut2617-2622
Sivumäärä6
ISBN (painettu)9781467357173
DOI - pysyväislinkit
TilaJulkaistu - 2013
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaIEEE Conference on Decision and Control - Florence, Italia
Kesto: 10 joulukuuta 201313 joulukuuta 2013
Konferenssinumero: 52

Conference

ConferenceIEEE Conference on Decision and Control
LyhennettäCDC
MaaItalia
KaupunkiFlorence
Ajanjakso10/12/201313/12/2013

Sormenjälki

Sukella tutkimusaiheisiin 'Decentralised minimum-time average consensus in digraphs'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä