Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals

DOI10.1109/TAC.2014.2352691MaRDI QIDQ2982778zbMATH OpenDBLPWikidataFDO

Authors Julien M. Hendrickx, Karl Henrik Johansson, Guodong Shi

Publication date 16 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1302.6668

Mathematics Subject Classification ID

Decentralized systems (93A14) Stochastic systems in control theory (general) (93E03)

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.

Cited in

(7)

• Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach
• Characterizing limits and opportunities in speeding up Markov chain mixing
• Student interactions during class activities: a mathematical model
• Distributed Model Predictive Control of linear discrete-time systems with local and global constraints
• Finite-time consensus of second-order multi-agent systems via a structural approach
• Performance and robustness of discrete and finite time average consensus algorithms
• Distributed finite-time tracking of second-order multi-agent systems: an edge-based approach

This page was built for publication: Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982778)