On the estimation of the consensus rate of convergence in graphs with persistent interconnections
From MaRDI portal
(Redirected from Publication:4568018)
Recommendations
- Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
- Tight estimates for convergence of some non-stationary consensus algorithms
- Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
- Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds
- Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
Cites work
- Consensus for agents with double integrator dynamics in heterogeneous networks
- Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
- Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
- Degree Fluctuations and the Convergence Time of Consensus Algorithms
- Exponential stability of linear equations arising in adaptive identification
- Graph theoretic methods in multiagent networks
- scientific article; zbMATH DE number 47865 (Why is no real title available?)
- scientific article; zbMATH DE number 3251929 (Why is no real title available?)
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Stability of multiagent systems with time-dependent communication links
- Uniform exponential stability of linear time-varying systems: revisited.
Cited in
(14)- Further results on the construction of strict Lyapunov-Krasovskii functionals for time-varying time-delay systems
- On construction of Lyapunov functions for scalar linear time-varying systems
- Edge-based strict Lyapunov functions for consensus with connectivity preservation over directed graphs
- Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
- An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs
- Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
- Stability and robustness of edge-agreement-based consensus protocols for undirected proximity graphs
- Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
- Consensus formation in first-order graphon models with time-varying topologies
- Consensus of networked double integrator systems under sensor bias
- Distributed tracking control of multiple high-order uncertain nonlinear systems with guaranteed performance
- Consensus of multiagent systems under communication failure
- Distributed estimation algorithms on undirected chained graphs with explicit characterization of consensus
- Tight estimates for convergence of some non-stationary consensus algorithms
This page was built for publication: On the estimation of the consensus rate of convergence in graphs with persistent interconnections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568018)