A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol
From MaRDI portal
Publication:963798
DOI10.1016/j.automatica.2009.03.027zbMath1185.93043OpenAlexW1974544033MaRDI QIDQ963798
Publication date: 14 April 2010
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2009.03.027
Feedback control (93B52) Decentralized systems (93A14) Synthesis problems (93B50) Control problems involving ordinary differential equations (34H05) Applications of graph theory to circuits and networks (94C15)
Related Items
Fast distributed consensus seeking in large-scale and high-density multi-agent systems with connectivity maintenance, Connectivity preservation for multi-agent rendezvous with link failure, A novel approach to coordination of multiple robots with communication failures via proximity graph, Virtual neighbor based connectivity preserving of multi-agent systems with bounded control inputs in the presence of unreliable communication links, Consensus of output-coupled high-order linear multi-agent systems under deterministic and Markovian switching networks
Cites Work
- Unnamed Item
- CONTINUOUS OPINION DYNAMICS UNDER BOUNDED CONFIDENCE: A SURVEY
- Consensus and Cooperation in Networked Multi-Agent Systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Local Control Strategies for Groups of Mobile Autonomous Agents
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- On the Rendezvous Problem for Multiple Nonholonomic Agents
- Lyapunov-Based Approach to Multiagent Systems With Switching Jointly Connected Interconnection
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment Algorithms