Random asynchronous iterations in distributed coordination algorithms

Distributed coordination algorithms (DCA) carry out information processing processes among a group of networked agents without centralized information fusion. Though it is well known that DCA characterized by an SIA (stochastic, indecomposable, aperiodic) matrix generate consensus asymptotically via synchronous iterations, the dynamics of DCA with asynchronous iterations have not been studied extensively, especially when viewed as stochastic processes. This paper aims to show that for any given irreducible stochastic matrix, even non-SIA, the corresponding DCA lead to consensus successfully via random asynchronous iterations under a wide range of conditions on the transition probability. Particularly, the transition probability is neither required to be independent and identically distributed, nor characterized by a Markov chain.

[1]  Karl Henrik Johansson,et al.  Generalized Sarymsakov Matrices , 2019, IEEE Transactions on Automatic Control.

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

[3]  Ziyang Meng,et al.  Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays , 2018, IEEE Transactions on Automatic Control.

[4]  Brian D. O. Anderson,et al.  Agreeing Asynchronously , 2008, IEEE Transactions on Automatic Control.

[5]  Ming Cao,et al.  Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms , 2014, IEEE Transactions on Automatic Control.

[6]  Danny Dolev,et al.  On the possibility and impossibility of achieving clock synchronization , 1984, STOC '84.

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

[8]  Karl Henrik Johansson,et al.  The Role of Persistent Graphs in the Agreement Seeking of Social Networks , 2011, IEEE Journal on Selected Areas in Communications.

[9]  Long Wang,et al.  Consensus protocols for discrete-time multi-agent systems with time-varying delays , 2008, Autom..

[10]  Angelia Nedic,et al.  Distributed Optimization Over Time-Varying Directed Graphs , 2015, IEEE Trans. Autom. Control..

[11]  Ming Cao,et al.  Asynchronous Implementation of Distributed Coordination Algorithms: Conditions Using Partially Scrambling and Essentially Cyclic Matrices , 2018, IEEE Transactions on Automatic Control.

[12]  Lihua Xie,et al.  Consensus condition for linear multi-agent systems over randomly switching topologies , 2013, Autom..

[13]  Karl Henrik Johansson,et al.  Products of generalized stochastic Sarymsakov matrices , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[14]  Xinghuo Yu,et al.  On the cluster consensus of discrete-time multi-agent systems , 2011, Syst. Control. Lett..

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

[16]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[17]  Daniel W. C. Ho,et al.  Convergence Rate for Discrete-Time Multiagent Systems With Time-Varying Delays and General Coupling Coefficients , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[18]  Wenwu Yu,et al.  Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems , 2010, Autom..

[19]  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..

[20]  Behrouz Touri,et al.  On backward product of stochastic matrices , 2011, Autom..

[21]  Karl Henrik Johansson,et al.  Structural Balance and Opinion Separation in Trust–Mistrust Social Networks , 2016, IEEE Transactions on Control of Network Systems.

[22]  Gang Xiong,et al.  Discrete-Time Second-Order Distributed Consensus Time Synchronization Algorithm for Wireless Sensor Networks , 2009, EURASIP J. Wirel. Commun. Netw..

[23]  Guanrong Chen,et al.  Pinning Control of Lag-Consensus for Second-Order Nonlinear Multiagent Systems , 2017, IEEE Transactions on Cybernetics.

[24]  Sadegh Bolouki,et al.  Ergodicity and class-ergodicity of balanced asymmetric stochastic chains , 2013, 2013 European Control Conference (ECC).

[25]  Vincent D. Blondel,et al.  How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard , 2012, SIAM J. Control. Optim..

[26]  John S. Baras,et al.  Convergence Results for the Linear Consensus Problem under Markovian Random Graphs , 2013, SIAM J. Control. Optim..

[27]  Alireza Tahbaz-Salehi,et al.  Consensus Over Ergodic Stationary Graph Processes , 2010, IEEE Transactions on Automatic Control.

[28]  Maurizio Porfiri,et al.  Consensus Seeking Over Random Weighted Directed Graphs , 2007, IEEE Transactions on Automatic Control.

[29]  Fangfei Li,et al.  Convergence of Infinite Products of Stochastic Matrices: A Graphical Decomposition Criterion , 2016, IEEE Transactions on Automatic Control.

[30]  El Kebir Boukas,et al.  Stability of discrete-time linear systems with Markovian jumping parameters , 1995, Math. Control. Signals Syst..