点击次数：

论文类型：期刊论文

发表时间：2019-11-01

发表刊物：AUTOMATICA

收录刊物：EI、SCIE

卷号：109

ISSN号：0005-1098

关键字：Distributed coordination algorithm; Asynchronous iteration; Random process; Consensus

摘要：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.