Gossip over holonomic graphs
From MaRDI portal
Publication:2063863
DOI10.1016/j.automatica.2021.110088zbMath1480.93018arXiv2102.08853OpenAlexW4205775608MaRDI QIDQ2063863
Mohamed-Ali Belabbas, Xudong Chen, Ji Liu
Publication date: 3 January 2022
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.08853
Stochastic systems in control theory (general) (93E03) Stochastic matrices (15B51) Multi-agent systems (93A16) Consensus (93D50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed averaging with linear objective maps
- Triangulated Laman graphs, local stochastic matrices, and limits of their products
- Non-negative matrices and Markov chains.
- Product of Random Stochastic Matrices
- On Convergence Rate of Weighted-Averaging Dynamics for Consensus Problems
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Matrix Analysis
- Towards consensus: some convergence theorems on repeated averaging
- Distributed Averaging Using Periodic Gossiping
- Cluster Consensus with Point Group Symmetries
- Reaching a Consensus
- How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Stability of multiagent systems with time-dependent communication links
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Products of Indecomposable, Aperiodic, Stochastic Matrices
This page was built for publication: Gossip over holonomic graphs
