On Conditions for Convergence to Consensus
arXiv:0803.2211 · doi:10.1109/TAC.2010.2046086
Abstract
A new theorem on conditions for convergence to consensus of a multiagent time-dependent time-discrete dynamical system is presented. The theorem is build up on the notion of averaging maps. We compare this theorem to results by Moreau (IEEE Transactions on Automatic Control, vol. 50, no. 2, 2005) about set-valued Lyapunov theory and convergence under switching communication topologies. We give examples that point out differences of approaches including examples where Moreau's theorem is not applicable but ours is. Further on, we give examples that demonstrate that the theory of convergence to consensus is still not complete.
5 pages, 2 columns, example added
References in corpus (1)
Cited by in corpus (10)
- Cooperative Network Synchronization: Asymptotic Analysis
- Efficient Information Aggregation Strategies for Distributed Control and Signal Processing
- Dynamical phase transitions in Hegselmann-Krause model of opinion dynamics and consensus
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
- Dynamic Models of Appraisal Networks Explaining Collective Learning
- Opinions within Media, Power and Gossip
- How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard
- Simulating Opinion Dynamics in Heterogeneous Communication
- Robustness of Information Diffusion Algorithms to Locally Bounded Adversaries
- Consensus of Multi-Agent Networks in the Presence of Adversaries Using Only Local Information