Tight estimates for convergence of some non-stationary consensus algorithms

DOI10.1016/J.SYSCONLE.2008.06.005zbMATH Open1148.93013arXiv0706.0630OpenAlexW2951914066MaRDI QIDQ953469FDOQ953469

Authors: David Angeli, Pierre-Alexandre Bliman 

Publication date: 20 November 2008

Published in: Systems \& Control Letters (Search for Journal in Brave)

Abstract: The present paper is devoted to estimating the speed of convergence towards consensus for a general class of discrete-time multi-agent systems. In the systems considered here, both the topology of the interconnection graph and the weight of the arcs are allowed to vary as a function of time. Under the hypothesis that some spanning tree structure is preserved along time, and that some nonzero minimal weight of the information transfer along this tree is guaranteed, an estimate of the contraction rate is given. The latter is expressed explicitly as the spectral radius of some matrix depending upon the tree depth and the lower bounds on the weights.

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

Recommendations

• Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
• Convergence speed in distributed consensus and averaging
• Convergence speed in distributed consensus and averaging
• On the estimation of the consensus rate of convergence in graphs with persistent interconnections
• Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds

zbMATH Keywords

convergence ratestochastic matricesuncertain systemslinear time-varying systemsmultiagent systemsPerron-Frobenius theorydistributed consensusmixing rates

Mathematics Subject Classification ID

Communication theory (94A05) Communication networks in operations research (90B18) Discrete-time control/observation systems (93C55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stability of multiagent systems with time-dependent communication links
• Spectral Properties of Matrices which have Invariant Cones
• Title not available (Why is that?)
• Geometric bounds for eigenvalues of Markov chains
• Title not available (Why is that?)
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
• On the Collatz-Wielandt numbers and the local spectral radius of a nonnegative operator
• Convergence speed in distributed consensus and averaging
• Stability of leaderless discrete-time multi-agent systems
• Title not available (Why is that?)
• Convergence Rates for Markov Chains
• A Simple Approach to the Perron-Frobenius Theory for Positive Operators on General Partially-Ordered Finite-Dimensional Linear Spaces
• Products of stochastic matrices and applications
• On the second real eigenvalue of nonegative and Z-matrices

Cited In (11)

• Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
• Optimizing the diffusion system based on continuous-time consensus algorithm
• Convergence and error estimates for time-discrete consensus-based optimization algorithms
• Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds
• On the estimation of the consensus rate of convergence in graphs with persistent interconnections
• Geometric bounds for convergence rates of averaging algorithms
• Delayed-state-derivative feedback for improving consensus performance of second-order delayed multi-agent systems
• Generalized ratio consensus - tight bounds on convergence rate
• Exponential convergence towards consensus for non-symmetric linear first-order systems in finite and infinite dimensions
• Adaptive control and signal processing literature survey (No. 7)
• Tight bound for deciding convergence of consensus systems

This page was built for publication: Tight estimates for convergence of some non-stationary consensus algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953469)