Local control strategies for groups of mobile autonomous agents
By Zhiyun Lin, Mireille E. Broucke, Bruce A. Francis. 2004
882 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Mechanical Engineering
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 Mechanical Engineering
- Wei Ren
- Francesco Bullo
- Yongcan Cao
- Long Wang
- Jorge Cortés
- Jean-Jacques E. Slotine
- Magnus Egerstedt
- Soon-Jo Chung
Citations in the corpus
- Deep Reinforcement Learning for Swarm Systems (2018, methodology): “A common strategy to obtain control strategies for swarm systems is to apply optimization–based approaches using the model of the agents or a graph abstraction of the swarm [Lin et al., 2004, Jadbabaie et al., 2003].”
- Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions (2006, background): “one adopted in most works on motion coordination including for example [1], [2], [3], [4].”
- Stabilization of symmetric formations to motion around convex loops (2008, neutral): “Preprint submitted to Elsevier 4 December 2006”
- Randomized gossip algorithms (2006, background): “Some other results on distributed averaging can be found in [6], [21], [30], [36], [37].”
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective (2009, background): “The localized rule in (2) happens to lead to the solution of the rendezvous problem, which has attracted considerable attention in the literature [8, 17, 22].”
- Agreement over random networks (2004, background): “The matrix exponentials appearing in (6) turn out to be stochastic matrices [8]; see also [10] and[ 12 ].”
- Distributed Coordination Control of Multiagent Systems While Preserving Connectedness (2007, background): “Digital Object Identifier 10.1109/TRO.2007.900638 t. Variations in this protocol consist mainly of different weight factors ki and αij .”
- Control of Minimally Persistent Formations in the Plane (2009, methodology): “As for the determination of the actual law, it is common [1, 2, 3, 4, 5, 6, 7, 12, 21] when distance constraints are bidirectional to select a type of Lyapunov function, typically reflecting the distance errors, and to choose the control laws to ensure that the derivative is nonpositive.”
- Tracking control for multi-agent consensus with an active leader and variable topology (2006, background): “Key words: Multi-agent systems, consensus, state estimation, active leader.”
- Robust consensus tracking of a class of second-order multi-agent dynamic systems (2010, background): “For example, they have been studied for different types of agent dynamics including first-order integrator dynamics (see, [3]–[5], [19], etc.”
- A survey of consensus problems in multi-agent coordination (2005, background): “As described in [2], [10], [11], [12], [13], [14], a continuous-time consensus protocol can be summarized as”
- Global Analysis of Multi-Agent Systems Based on Vicsek's Model (2009, background): “Other works discussing averaging consensus protocols include [2], [4], [6], [9] [11], [14], [16], [17], [23], and [10], [15].”
- On the consensus and bipartite consensus in high-order multi-agent dynamical systems with antagonistic interactions (2014, background): “…formulated as that of a group of agents exchanging information with the objective of reaching a common decision, a consensus, by resorting to distributed algorithms that make use of the information that each agent collects from neighboring agents (see, e.g. [2, 11, 12, 15, 19, 20, 21, 24, 25, 27].”
- Distributed algorithms for reaching consensus on general functions (2008, background): “Coordination problems that focus, instead, on “spatial versions” of consensus include rendezvous [1, 9, 18, 19], flocking [4, 14, 21, 22], and synchronization [15, 29].”
- Cooperative control for target-capturing task based on a cyclic pursuit strategy (2007, methodology): “Since it is obvious that (6) implies (A2′) and (7) implies (A3′), we will prove that (A1′) is achieved based on a similar idea used in Lin et al. (2004).”