Consensus problems in networks of agents with switching topology and time-delays
TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
read more
Abstract: In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The theory of pattern formation on directed networks
TL;DR: The theory of pattern formation in reaction-diffusion systems defined on symmetric networks is extended to the case of directed networks, which are found in a number of different fields, such as neuroscience, computer networks and traffic systems.
Observer design for tracking consensus in second-order multi-agent systems: Fractional order less than two
TL;DR: This technical note studies the leader-following tracking consensus problem of a class of multi-agent systems where the dynamics of the leader is described by second-order systems and finds that the real and imaginary parts of the eigenvalues of the augmented Laplacian matrix of the topology play an important role in achieving consensus.
175
Distributed Consensus Based Algorithm for Economic Dispatch in a Microgrid
TL;DR: Using multi-parameter perturbation theory and graph theory, the convergence of the algorithm is proved and it is obtained that the algorithm converges to the optimal solution at a rate governed by the second largest eigenvalue of the system matrix.
175
Sampled-data based average consensus of second-order integral multi-agent systems: Switching topologies and communication noises
TL;DR: Under the proposed protocol, it is proved that sufficient conditions for ensuring mean square average consensus are: the consensus gain satisfies the stochastic approximation type condition and the communication topology graph at each sampling instant is a balanced graph with a spanning tree.
174
Dynamic Event-Triggered Control for Leader-Following Consensus of Multiagent Systems
TL;DR: The leader-following consensus problem of multiagent systems with general dynamics under event-triggered mechanisms is investigated and a multiagent system consisting of interconnected pendulums is provided to demonstrate the merits and correctness of the proposed methods.
174
References
Flocks, herds and schools: A distributed behavioral model
Craig W. Reynolds
- 01 Aug 1987
TL;DR: In this article, an approach based on simulation as an alternative to scripting the paths of each bird individually is explored, with the simulated birds being the particles and the aggregate motion of the simulated flock is created by a distributed behavioral model much like that at work in a natural flock; the birds choose their own course.
•Book
Algebraic Graph Theory
Chris Godsil,Gordon F. Royle +1 more
- 01 Jan 2009
TL;DR: The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
Exploring complex networks
TL;DR: This work aims to understand how an enormous network of interacting dynamical systems — be they neurons, power stations or lasers — will behave collectively, given their individual dynamics and coupling architecture.
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Ali Jadbabaie,Jie Lin,A.S. Morse +2 more
TL;DR: A theoretical explanation for the observed behavior of the Vicsek model, which proves to be a graphic example of a switched linear system which is stable, but for which there does not exist a common quadratic Lyapunov function.
Novel Type of Phase Transition in a System of Self-Driven Particles
TL;DR: Numerical evidence is presented that this model results in a kinetic phase transition from no transport to finite net transport through spontaneous symmetry breaking of the rotational symmetry.
7.7K