Decentralised Minimum-Time Average Consensus in Digraphs
2013 (English)In: 2013 IEEE 52nd Annual Conference on Decision and Control (CDC), IEEE conference proceedings, 2013, 2617-2622 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 2617-2622 p.
, Proceedings of the IEEE Conference on Decision & Control / IEEE Control Systems Society. IEEE Conference on Decision & Control, ISSN 0743-1546
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-136173ISI: 000352223503008ScopusID: 2-s2.0-84902324372ISBN: 978-1-4673-5714-2OAI: oai:DiVA.org:kth-136173DiVA: diva2:675505
2013 IEEE 52nd Annual Conference on Decision and Control (CDC);Firenze, Italy, 10-13 December, 2013
QC 201403132013-12-042013-12-042015-12-08Bibliographically approved