Change search
ReferencesLink to record
Permanent link

Direct link
Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
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
Abstract [en]

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
Keyword [en]
Agents and autonomous systems, finite-time consensus, sensor networks
National Category
Control Engineering
URN: urn:nbn:se:kth:diva-165201DOI: 10.1109/TAC.2014.2352691ISI: 000351731600014ScopusID: 2-s2.0-84926367071OAI: diva2:810509

QC 20150507

Available from: 2015-05-07 Created: 2015-04-24 Last updated: 2015-05-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Johansson, Karl H.
By organisation
Automatic ControlACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Automatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 30 hits
ReferencesLink to record
Permanent link

Direct link