Internal stability of linear consensus processes

In a network of n agents, consensus means that all n agents reach an agreement on a specific value of some quantity via local interactions. A linear consensus process can typically be modeled by a discrete-time linear recursion equation or a continuous-time linear differential equation, whose equilibria include nonzero states of the form a1 where a is a constant and 1 is a column vector in ℝn whose entries all equal 1. Using a suitably defined semi-norm, this paper extends the standard notions of uniform asymptotic stability and exponential stability from linear systems to linear recursions and differential equations of this type. It is shown that these notions are equivalent just as they are for conventional linear systems. The main contributions of this paper are first to provide a simple, direct proof of the necessary graph-theoretic condition given in [1] for a discrete-time linear consensus process to be exponentially stable, and second to derive a necessary graph-theoretic condition for a piecewise time-invariant continuous-time linear consensus process to be exponentially stable.

[1]  Ιωαννησ Τσιτσικλησ,et al.  PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION , 1984 .

[2]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[3]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[4]  Timothy W. McLain,et al.  Coordination Variables and Consensus Building in Multiple Vehicle Systems , 2004 .

[5]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[6]  L. Moreau,et al.  Stability of continuous-time distributed consensus algorithms , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[7]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  Manfredi Maggiore,et al.  Necessary and sufficient graphical conditions for formation control of unicycles , 2005, IEEE Transactions on Automatic Control.

[9]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[10]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[11]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[12]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[13]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[14]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[15]  João Pedro Hespanha,et al.  Linear Systems Theory , 2009 .

[16]  B. Anderson,et al.  The Contraction Coefficient of a Complete Gossip Sequence , 2010 .

[17]  Brian D. O. Anderson,et al.  Contractions for consensus processes , 2011, IEEE Conference on Decision and Control and European Control Conference.

[18]  Shaoshuai Mou,et al.  Deterministic Gossiping , 2011, Proceedings of the IEEE.

[19]  John N. Tsitsiklis,et al.  A new condition for convergence in continuous-time consensus seeking systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

[20]  Behrouz Touri,et al.  Product of Random Stochastic Matrices , 2011, IEEE Transactions on Automatic Control.

[21]  Angelia Nedic,et al.  A Lyapunov approach to discrete-time linear consensus , 2014, 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).