Necessary and sufficient conditions for consensus over random independent and identically distributed switching graphs

In this paper we consider the consensus problem for stochastic switched linear dynamical systems. For discrete- time and continuous-time stochastic switched linear systems, we present necessary and sufficient conditions under which such systems reach a consensus almost surely. In the discrete-time case, our assumption is that the underlying graph of the system at any given time instance is derived from a random graph process, independent of other time instances. These graphs can be weighted, directed and with dependent edges. For the continuous-time case, we assume that the switching is governed by a Poisson point process and the graphs characterizing the topology of the system are independent and identically distributed over time. For both such frameworks, we present necessary and sufficient conditions for almost sure asymptotic consensus using simple ergodicity and probabilistic arguments. These easily verifiable conditions depend on the spectrum of the average weight matrix and the average Laplacian matrix for the discrete-time and continuous-time cases, respectively.

[1]  R. Dobrushin.  Central Limit Theorem for Nonstationary Markov Chains. II , 1956 .

[2]  M. Degroot.  Reaching a Consensus , 1974 .

[3]  E. Seneta,et al.  Towards consensus: some convergence theorems on repeated averaging , 1977, Journal of Applied Probability.

[4]  R. Cogburn.  The ergodic theory of Markov chains in random environments , 1984 .

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

[6]  R. Durrett.  Probability: Theory and Examples , 1993 .

[7]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

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

[9]  João Pedro Hespanha,et al.  Uniform stability of switched linear systems: extensions of LaSalle's Invariance Principle , 2004, IEEE Transactions on Automatic Control.

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

[11]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[12]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[13]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Chai Wah Wu,et al.  Synchronization and convergence of linear dynamics in random directed networks , 2006, IEEE Transactions on Automatic Control.

[15]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

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