On the general consensus protocol of multi-agent systems with double-integrator dynamics
Reads0
Chats0
TLDR
A periodic consensus protocol for multi-agent systems with double-integrator dynamics is obtained and it is revealed that the maximum convergence speed can be achieved by choosing suitable gains.About:
This article is published in Linear Algebra and its Applications.The article was published on 2009-08-01 and is currently open access. It has received 153 citations till now. The article focuses on the topics: Uniform consensus & Consensus dynamics.read more
Citations
More filters
Journal ArticleDOI
Distributed Consensus of Second-Order Multi-Agent Systems With Heterogeneous Unknown Inertias and Control Gains Under a Directed Graph
TL;DR: This paper proposes fully distributed consensus algorithms over a general directed graph when there exist, respectively, absolute velocity damping and relative velocity damped and shows that one proposed algorithm also works for consensus of agents with intrinsic Lipschitz nonlinear dynamics.
Journal ArticleDOI
Second-order consensus for multi-agent systems with switching topology and communication delay
TL;DR: This paper investigates two kinds of consensus problems for second-order agents under directed and arbitrarily switching topologies, that is, the cases without and with communication delay, and shows that consensus can be reached if the delay is small enough.
Journal ArticleDOI
Consensus of heterogeneous multi-agent systems
TL;DR: In this paper, the consensus problem of heterogeneous multi-agent systems is considered and sufficient conditions for consensus are established when the communication topologies are undirected connected graphs and leader-following networks.
Journal ArticleDOI
Cooperative adaptive control for synchronization of second‐order systems with unknown nonlinearities
Abhijit Das,Frank L. Lewis +1 more
TL;DR: In this paper, a cooperative tracking adaptive controller is designed based on each node maintaining a neural network parametric approximator and suitably tuning it to guarantee stability and performance, and a Lyapunov-based proof shows the ultimate boundedness of the tracking error.
Journal ArticleDOI
Distributed coordination for second-order multi-agent systems with nonlinear dynamics using only relative position measurements
Jie Mei,Wei Ren,Guangfu Ma +2 more
TL;DR: This paper derives a necessary and sufficient condition for the leaderless consensus problem under a general directed graph and introduces a distributed filter for each agent or follower to show the effectiveness of the proposed control algorithms.
References
More filters
Journal ArticleDOI
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.
Journal ArticleDOI
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.
Journal ArticleDOI
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.
Journal ArticleDOI
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Wei Ren,Randal W. Beard +1 more
TL;DR: It is shown that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.
Journal ArticleDOI
Flocking for multi-agent dynamic systems: algorithms and theory
TL;DR: A theoretical framework for design and analysis of distributed flocking algorithms, and shows that migration of flocks can be performed using a peer-to-peer network of agents, i.e., "flocks need no leaders."
Related Papers (5)
Consensus problems in networks of agents with switching topology and time-delays
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Wei Ren,Randal W. Beard +1 more
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Ali Jadbabaie,Jie Lin,A.S. Morse +2 more