Random asynchronous iterations in distributed coordination algorithms

Chen, Y., Xia, W., Cao, M. & Lu, J., Nov-2019, In : Automatica. 109, 8 p., 108505.

Research output: Contribution to journalArticleAcademicpeer-review

Copy link to clipboard


  • Random asynchronous iterations in distributed coordination algorithms

    Final publisher's version, 962 KB, PDF document

    Request copy


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 i.i.d, nor characterized by a Markov chain. (C) 2019 Elsevier Ltd. All rights reserved.

Original languageEnglish
Article number108505
Number of pages8
Early online date13-Aug-2019
Publication statusPublished - Nov-2019


  • Distributed coordination algorithm, Asynchronous iteration, Random process, Consensus, CONSENSUS, SYSTEMS, SEEKING, PRODUCT

ID: 101441598