Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals

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

doi:10.1109/TAC.2014.2352691

Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals

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

Research output: Contribution to journal › Article › peer-review

54 Citations (Scopus)

Abstract

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.

Original language	English
Article number	6887337
Pages (from-to)	1070-1073
Number of pages	4
Journal	IEEE Transactions on Automatic Control
Volume	60
Issue number	4
DOIs	https://doi.org/10.1109/TAC.2014.2352691
Publication status	Published - 1 Apr 2015

Access to Document

10.1109/TAC.2014.2352691

Cite this

@article{92b4442b254c4ffa87decca966e57d1d,

title = "Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals",

abstract = "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.",

keywords = "Agents and autonomous systems, finite-time consensus, sensor networks",

author = "Hendrickx, {Julien M.} and Guodong Shi and Johansson, {Karl H.}",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2015",

month = apr,

day = "1",

doi = "10.1109/TAC.2014.2352691",

language = "English",

volume = "60",

pages = "1070--1073",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals

AU - Hendrickx, Julien M.

AU - Shi, Guodong

AU - Johansson, Karl H.

PY - 2015/4/1

Y1 - 2015/4/1

N2 - 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.

AB - 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.

KW - Agents and autonomous systems

KW - finite-time consensus

KW - sensor networks

UR - http://www.scopus.com/inward/record.url?scp=84926367071&partnerID=8YFLogxK

U2 - 10.1109/TAC.2014.2352691

DO - 10.1109/TAC.2014.2352691

M3 - Article

SN - 0018-9286

VL - 60

SP - 1070

EP - 1073

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 4

M1 - 6887337

ER -

Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals

Abstract

Access to Document

Other files and links

Fingerprint

Cite this