Random asynchronous iterations in distributed coordination algorithms

DOI10.1016/J.AUTOMATICA.2019.108505MaRDI QIDQ2280907zbMATH OpenOpenAlexWikidataFDO

Authors Yao Chen, Weiguo Xia, Ming Cao, Jin-Hu Lü

Publication date 19 December 2019

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.10554, https://pure.rug.nl/ws/files/101441602/1_s2.0_S0005109819303668_main.pdf

zbMATH Keywords

consensusrandom processasynchronous iterationdistributed coordination algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15) Stochastic systems in control theory (general) (93E03) Consensus (93D50)

Abstract: 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.

Recommendations

• Asymptotic agreement and convergence of asynchronous stochastic algorithms
• Convergence analysis of asynchronous linear iterations with stochastic delays
• Asynchronous stochastic approximation algorithms for networked systems: regime-switching topologies and multiscale structure
• Asynchronous Stochastic Approximations
• Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms

Cites work

• scientific article; zbMATH DE number 6936878 (Why is no real title available?)
• Agreeing Asynchronously
• Consensus Over Ergodic Stationary Graph Processes
• Consensus Seeking Over Random Weighted Directed Graphs
• Consensus condition for linear multi-agent systems over randomly switching topologies
• Convergence of Infinite Products of Stochastic Matrices: A Graphical Decomposition Criterion
• Convergence results for the linear consensus problem under Markovian random graphs
• Distributed Optimization Over Time-Varying Directed Graphs
• Generalized Sarymsakov Matrices
• How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard
• Non-negative matrices and Markov chains. 2nd ed
• On backward product of stochastic matrices
• On the possibility and impossibility of achieving clock synchronization
• Product of Random Stochastic Matrices
• Reaching a Consensus
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
• Stability of discrete-time linear systems with Markovian jumping parameters

Cited in

(7)

• Random Node-Asynchronous Updates on Graphs
• Data Collection in Population Protocols with Non-uniformly Random Scheduler
• scientific article; zbMATH DE number 1305416 (Why is no real title available?)
• A two-layer model for coevolving opinion dynamics and collective decision-making in complex social systems
• Data collection in population protocols with non-uniformly random scheduler
• Mathematical models of self-appraisal in social networks
• scientific article; zbMATH DE number 1788242 (Why is no real title available?)

This page was built for publication: Random asynchronous iterations in distributed coordination algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280907)