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

DOI10.1016/J.EJCON.2015.12.005MaRDI QIDQ328046zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatoricsadaptive controlconsensusRamsey theorytime-varying systemscooperative controlpersistence of excitation

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1001723 (Why is no real title available?)
• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 49099 (Why is no real title available?)
• 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
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
• Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis
• Graph theoretic methods in multiagent networks
• On the Stability of Nonautonomous Differential Equations $\dot x = [A + B(t)]x$, with Skew Symmetric Matrix $B(t)$
• On the general consensus protocol of multi-agent systems with double-integrator dynamics
• Passivity as a Design Tool for Group Coordination
• Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
• Persistence filter-based control for systems with time-varying control gains
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• Uniform stabilization for linear systems with persistency of excitation: the neutrally stable and the double integrator cases

Cited in

(9)

• 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
• Coupled output synchronization in networked systems
• Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
• A new condition for asymptotic consensus over switching graphs
• Analysis and stability of consensus in networked control systems
• Persistence based convergence rate analysis of consensus protocols for dynamic graph networks
• Saturation-tolerant average consensus with controllable rates of convergence
• On the estimation of the consensus rate of convergence in graphs with persistent interconnections

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)