Convergence to consensus by general averaging
From MaRDI portal
Publication:3407642
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.
Recommendations
- A discrete nonlinear and non-autonomous model of consensus formation
- Convergence speed in distributed consensus and averaging
- Convergence speed in distributed consensus and averaging
- Reaching a consensus: a discrete nonlinear time-varying case
- Consensus dynamics with arbitrary sign-preserving nonlinearities
Cited in
(13)- On the mathematics of emergence
- Fast convergence for consensus in dynamic networks
- Fast convergence for consensus in dynamic networks
- Convergence of the multidimensional agreement algorithm when communication fades away
- Condensing
- Compromise, consensus, and the iteration of means
- Wolfowitz's theorem and consensus algorithms in Hadamard spaces
- Consensus Driven by the Geometric Mean
- Exponential convergence towards consensus for non-symmetric linear first-order systems in finite and infinite dimensions
- Moving average network examples for asymptotically stable periodic orbits of monotone maps
- A discrete nonlinear and non-autonomous model of consensus formation
- MinMax algorithms for stabilizing consensus
- Convergence results for unanimous voting
This page was built for publication: Convergence to consensus by general averaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3407642)