Skip navigation
Skip navigation

Finite-time consensus using stochastic matrices with positive diagonals

Hendrickx, Julien M.; Shi, Guodong; Johansson, Karl H.


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...[Show more]

CollectionsANU Research Publications
Date published: 2015-04-01
Type: Journal article
Source: IEEE Transactions on Automatic Control
DOI: 10.1109/TAC.2014.2352691


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator