Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
DOI10.1016/J.EJCON.2015.12.005zbMATH Open1347.93010OpenAlexW2227675293MaRDI QIDQ328046FDOQ328046
Authors: Nilanjan Roy Chowdhury, Srikant Sukumar, Niranjan Balachandran 
Publication date: 20 October 2016
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejcon.2015.12.005
Recommendations
- On the estimation of the consensus rate of convergence in graphs with persistent interconnections
- Consensus for agents with double integrator dynamics in heterogeneous networks
- Consensus with constrained convergence rate and time-delays
- Consensus control for a class of networks of dynamic agents
- Analysis and stability of consensus in networked control systems
combinatoricsadaptive controlconsensusRamsey theorytime-varying systemscooperative controlpersistence of excitation
Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Adaptive control/observation systems (93C40) Applications of graph theory to circuits and networks (94C15) Ramsey theory (05D10)
Cites Work
- Title not available (Why is that?)
- Graph theoretic methods in multiagent networks
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- A new proof of Szemerédi's theorem
- Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Title not available (Why is that?)
- Passivity as a Design Tool for Group Coordination
- Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
- Persistence filter-based control for systems with time-varying control gains
- On the general consensus protocol of multi-agent systems with double-integrator dynamics
- Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
- Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
- Title not available (Why is that?)
- On the Stability of Nonautonomous Differential Equations $\dot x = [A + B(t)]x$, with Skew Symmetric Matrix $B(t)$
- Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis
- Uniform stabilization for linear systems with persistency of excitation: the neutrally stable and the double integrator cases
Cited In (8)
- Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
- Coupled output synchronization in networked systems
- Analysis and stability of consensus in networked control systems
- On the estimation of the consensus rate of convergence in graphs with persistent interconnections
- Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
- Cooperative control of double-integrator agents with heterogeneous control gains: exponential consensus conditions and the heterogeneity-metric
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- A new condition for asymptotic consensus over switching graphs
This page was built for publication: Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328046)
