Stable flocking of mobile agents, part I: fixed topology
By Herbert G. Tanner, Ali Jadbabaie, George Pappas. 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475), 2003
806 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Condensed Matter Physics, Control and Systems Engineering
View Paper: https://www.semanticscholar.org/paper/4d141edc1807a57710619a4ffe8b1b689efc3f2f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Condensed Matter Physics
In Control and Systems Engineering
Citations in the corpus
- Average consensus problems in networks of agents with delayed communications (2005, background): “ṽ(1, t) ≡ [2, 2], ṽ(2, t) ≡ [2, −2], ṽ(3, t) ≡ [1, 3]”
- Flocking of multi-agents with a virtual leader part I: with a minority of informed agents (2007, methodology): “Recently, flocking algorithms based on Reynolds flocking model were proposed by a combination of a velocity consensus component with a local artificial potential field [14], [15], [16].”
- Passivity as a Design Tool for Group Coordination (2007, background): “Examples Example 1(Formation Control): When applied to the problem of formation stabilization, Theorem 1 recovers the stability results of [1] and [2], and gives a passivity interpretation.”
- Decentralised minimal-time consensus (2011, background): “,8[1]} = 1.”
- Average consensus on networks with transmission noise or quantization (2007, background): “In recent years much research has been focused on the coordinated control and estimation [1], [2], [4], [5], [6], [8], [9].”
- On the controllability of nearest neighbor interconnections (2004, background): “Potential fields have been combined with synchronization control inputs to yield coordinated formation and decentralized flocking and swarming motion [6], [7], [8], [9].”
- Finite-time convergent gradient flows with applications to network consensus (2006, background): “Previous work on motion coordination of multi-agent systems has proposed cooperative algorithms based on gradient flows to achieve tasks such as cohesiveness [11, 14, 20], deployment [8, 9] and consensus [15, 16, 17], The distributed algorithms in these works achieve the desired coordination task ov”
- Synchronization of coupled harmonic oscillators in a dynamic proximity network (2009, methodology): “In the synchronization [10], second-order consensus ([11], [13]) and flocking ([14], [15], [16], [17]) algorithms, certain network connectivity assumptions play a crucial role in the stability analysis.”