Convergence to consensus by general averaging

DOI10.1007/978-3-642-02894-6_9zbMATH Open1182.93079arXiv0803.2211OpenAlexW206643989MaRDI QIDQ3407642FDOQ3407642

Authors: Dirk A. Lorenz, Jan-Hendrik Lorenz 

Publication date: 4 March 2010

Published in: Positive Systems (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0803.2211

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

zbMATH Keywords

averaging mapsconvergence to consensusdiscrete nonlinear non-homogeneous dynamical system

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55)

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
• Consensus Driven by the Geometric Mean
• Wolfowitz's theorem and consensus algorithms in Hadamard spaces
• 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)