On the estimation of the consensus rate of convergence in graphs with persistent interconnections
From MaRDI portal
Publication:4568018
DOI10.1080/00207179.2016.1272006zbMath1390.93026OpenAlexW2562081298MaRDI QIDQ4568018
Nilanjan Roy Chowdhury, Mohamed Adlene Maghenem, Antonio Loría, Srikant Sukumar
Publication date: 20 June 2018
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179.2016.1272006
Programming involving graphs or networks (90C35) Decentralized systems (93A14) Asymptotic stability in control theory (93D20) Applications of graph theory to circuits and networks (94C15)
Related Items (4)
Edge-based strict Lyapunov functions for consensus with connectivity preservation over directed graphs ⋮ 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 ⋮ Stability and robustness of edge-agreement-based consensus protocols for undirected proximity graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniform exponential stability of linear time-varying systems: revisited.
- Continuous-Time Consensus under Persistent Connectivity and Slow Divergence of Reciprocal Interaction Weights
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Exponential stability of linear equations arising in adaptive identification
- Stability of multiagent systems with time-dependent communication links
- Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
- Degree Fluctuations and the Convergence Time of Consensus Algorithms
- Consensus for Agents with Double Integrator Dynamics in Heterogeneous Networks
This page was built for publication: On the estimation of the consensus rate of convergence in graphs with persistent interconnections
