Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals
2015 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 60, no 4, 1070-1073 p., 6887337Article in journal (Refereed) Published
We discuss the possibility of reaching consensus in finite time using only linear iterations, with the additional restrictions that the update matrices must be stochastic with positive diagonals and consistent with a given graph structure. We show that finite-time average consensus can always be achieved for connected undirected graphs. For directed graphs, we show some necessary conditions for finite-time consensus, including strong connectivity and the presence of a simple cycle of even length.
Place, publisher, year, edition, pages
2015. Vol. 60, no 4, 1070-1073 p., 6887337
Agents and autonomous systems, finite-time consensus, sensor networks
IdentifiersURN: urn:nbn:se:kth:diva-165201DOI: 10.1109/TAC.2014.2352691ISI: 000351731600014ScopusID: 2-s2.0-84926367071OAI: oai:DiVA.org:kth-165201DiVA: diva2:810509
QC 201505072015-05-072015-04-242015-05-07Bibliographically approved