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

DOI10.1137/060673527zbMath1182.93004arXivmath/0610854MaRDI 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 theory; convergence rate; multiagent systems; distributed consensus

Mathematics Subject Classification ID

05C90: Applications of graph theory

90B18: Communication networks in operations research

93C55: Discrete-time control/observation systems

93C05: Linear systems in control theory

93A14: Decentralized systems

93D20: Asymptotic stability in control theory

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

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