Practical multiagent rendezvous through modified circumcenter algorithms
From MaRDI portal
Publication:1036666
DOI10.1016/j.automatica.2009.05.013zbMath1175.93163MaRDI QIDQ1036666
Publication date: 13 November 2009
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2009.05.013
93C85: Automated systems (robots, etc.) in control theory
93E03: Stochastic systems in control theory (general)
Related Items
RobustL2 − L∞consensus control for uncertain high-order multi-agent systems with time-delay, L2 − L∞ Consensus Control for High‐Order Multi‐Agent Systems with Nonuniform Time‐Varying Delays, Computing by Mobile Robotic Sensors, Connectivity preservation for multi-agent rendezvous with link failure, Practical multiagent rendezvous through modified circumcenter algorithms, Collisionless Gathering of Robots with an Extent
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed average consensus with least-mean-square deviation
- Practical multiagent rendezvous through modified circumcenter algorithms
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
- On the Rendezvous Problem for Multiple Nonholonomic Agents
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment Algorithms