The most exigent eigenvalue: guaranteeing consensus under an unknown communication topology and time delays
From MaRDI portal
Publication:6173487
Abstract: In the analysis of consensus problems for multi-agent systems affected by time delays, the delay margin for a given protocol is heavily dependent on the communication topology being used. This document aims to answer the question of what is the largest delay value under which convergence to consensus is still possible even if the communication topology is not known. To answer this question we revisit the concept of most exigent eigenvalue, applying it to two different consensus protocols for agents driven by second order dynamics. We show how the delay margin depends on the structure of the consensus protocol and the communication topology, and arrive to a boundary that guarantees consensus for any connected communication topology. The switching topologies case is also studied and It is shown that for one protocol the stability of the individual topologies is sufficient to guarantee consensus in the switching case, whereas for the other one it is not.
Recommendations
- Consensus with constrained convergence rate and time-delays
- Exhaustive stability analysis in a consensus system with time delay and irregular topologies
- Consensus for networked multi-agent systems with unknown communication delays
- Multi-agent consensus with diverse time-delays and jointly-connected topologies
- Consensus of second-order multiagent systems with fixed topology and time-delay
Cites work
- A consensus protocol under directed communications with two time delays and delay scheduling
- A linear time-invariant consensus dynamics with homogeneous delays: analytical study and synthesis of rightmost eigenvalues
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- Allowable delay bound for consensus of linear multi-agent systems with communication delay
- An Exact Method for the Stability Analysis of Linear Consensus Protocols With Time Delay
- An exact method for the stability analysis of time-delayed linear time-invariant (LTI) systems
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- Complete stability robustness of third-order LTI multiple time-delay systems
- Consensus analysis with large and multiple communication delays using spectral delay space concept
- Consensus of a Class of Second-Order Multi-Agent Systems With Time-Delay and Jointly-Connected Topologies
- Consensus of Multi-Agent Systems in Directed Networks With Nonuniform Time-Varying Delays
- Consensus of Multi-Agent Systems With Unbounded Time-Varying Delays
- Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies
- Consensus problems in networks of agents with double-integrator dynamics and time-varying delays
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Delay robustness in consensus problems
- Delay-dependent coupling for a multi-agent LTI consensus system with inter-agent delays
- Distributed robust \(H_\infty \) consensus control in directed networks of agents with time-delay
- Eigenvalues of the Laplacian of a graph∗
- Exhaustive stability analysis in a consensus system with time delay and irregular topologies
- Extended Kronecker Summation for Cluster Treatment of LTI Systems with Multiple Delays
- Finding the exact delay bound for consensus of linear multi-agent systems
- Formation control of multi-agent systems with heterogeneous communication delays
- Gershgorin's Theorem and the Zeros of Polynomials
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Limiting representations of weighted pseudoinverse matrices with positive definite weights. Problem regularization
- On Consensus Algorithms for Double-Integrator Dynamics
- Sharp upper bounds for the Laplacian graph eigenvalues
- Stability Robustness Analysis of Multiple Time- Delayed Systems Using “Building Block” Concept
- State consensus for multi-agent systems with switching topologies and time-varying delays
- Tutorial on Lyapunov-based methods for time-delay systems
Cited in
(2)
This page was built for publication: The most exigent eigenvalue: guaranteeing consensus under an unknown communication topology and time delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173487)
