Persistence based convergence rate analysis of consensus protocols for dynamic graph networks

DOI10.1016/j.ejcon.2015.12.005zbMath1347.93010OpenAlexW2227675293MaRDI QIDQ328046

Srikant Sukumar, Nilanjan Roy Chowdhury, 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

zbMATH Keywords

combinatoricsadaptive controltime-varying systemsRamsey theoryconsensuspersistence of excitationcooperative control

Mathematics Subject Classification ID

Adaptive control/observation systems (93C40) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15) Ramsey theory (05D10) Agent technology and artificial intelligence (68T42)

Related Items (4)

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 ⋮ Coupled output synchronization in networked systems ⋮ A new condition for asymptotic consensus over switching graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
• Uniform stabilization for linear systems with persistency of excitation: the neutrally stable and the double integrator cases
• Persistence filter-based control for systems with time-varying control gains
• On the general consensus protocol of multi-agent systems with double-integrator dynamics
• Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Continuous-Time Consensus under Persistent Connectivity and Slow Divergence of Reciprocal Interaction Weights
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• On the Stability of Nonautonomous Differential Equations $\dot x = [A + B(t)x$, with Skew Symmetric Matrix $B(t)$]
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Passivity as a Design Tool for Group Coordination
• Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis
• Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
• A new proof of Szemerédi's theorem

This page was built for publication: Persistence based convergence rate analysis of consensus protocols for dynamic graph networks