Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees

DOI10.1137/060673527zbMath1182.93004arXivmath/0610854OpenAlexW1995565680MaRDI QIDQ5190241

Pierre-Alexandre Bliman, David Angeli

Publication date: 15 March 2010

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

graph theoryconvergence ratemultiagent systemsdistributed consensus

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05) Decentralized systems (93A14) Asymptotic stability in control theory (93D20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (9)

Synchronizing nonlinear complex networks via switching disconnected topology ⋮ Convergence analysis of discrete-time consensus algorithm with both self and transmission delays ⋮ Linear Time Average Consensus and Distributed Optimization on Fixed Graphs ⋮ Multi-agent flocking under topological interactions ⋮ Dobrushin's ergodicity coefficient for Markov operators on cones ⋮ Tight estimates for convergence of some non-stationary consensus algorithms ⋮ On the cluster consensus of discrete-time multi-agent systems ⋮ Convergence rate for consensus with delays ⋮ Event-triggered synchronization for second-order nodes in complex dynamical network with time-varying coupling matrices

This page was built for publication: Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees