A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol
DOI10.1016/J.AUTOMATICA.2009.03.027zbMATH Open1185.93043OpenAlexW1974544033MaRDI QIDQ963798FDOQ963798
Authors: Zhendong Sun, Jie Huang 
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
Recommendations
- A note on basic consensus problems in multi-agent systems with switching interconnection graphs
- Robustness and Invariance of Connectivity Maintenance Control for Multiagent Systems
- Virtual neighbor based connectivity preserving of multi-agent systems with bounded control inputs in the presence of unreliable communication links
- A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems
- Controllability of multi-agent systems from a graph-theoretic perspective
- Deviation bounds in multi-agent systems described by undirected graphs
- Connectivity Preservation in Nonholonomic Multi-Agent Systems: A Bounded Distributed Control Strategy
- Graph-theoretic characterization of controllability for multi-agent systems
- A connectivity reduction strategy for multi-agent systems
- Bounded Hybrid Connectivity Control of Networked Multiagent Systems
Control problems involving ordinary differential equations (34H05) Decentralized systems (93A14) Synthesis problems (93B50) Feedback control (93B52) Applications of graph theory to circuits and networks (94C15)
Cites Work
- 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
- 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
- Local Control Strategies for Groups of Mobile Autonomous Agents
- Lyapunov-Based Approach to Multiagent Systems With Switching Jointly Connected Interconnection
- A discrete nonlinear and non-autonomous model of consensus formation
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment Algorithms
Cited In (8)
- Connectivity graphs as models of local interactions
- Connectivity preservation for multi-agent rendezvous with link failure
- A novel approach to coordination of multiple robots with communication failures via proximity graph
- Stability and robustness of edge-agreement-based consensus protocols for undirected proximity graphs
- Fast distributed consensus seeking in large-scale and high-density multi-agent systems with connectivity maintenance
- Virtual neighbor based connectivity preserving of multi-agent systems with bounded control inputs in the presence of unreliable communication links
- A line of sight constraint based on intermediary points for connectivity maintenance of multiagent systems using mixed-integer programming
- Consensus of output-coupled high-order linear multi-agent systems under deterministic and Markovian switching networks
This page was built for publication: A note on connectivity of multi-agent systems with proximity graphs and linear feedback protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963798)
