Practical multiagent rendezvous through modified circumcenter algorithms

DOI10.1016/J.AUTOMATICA.2009.05.013zbMath1175.93163OpenAlexW2002501738MaRDI QIDQ1036666

Sonia Martínez

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

zbMATH Keywords

multiagent systemsmobile robotsmotion coordinationautonomous vehiclesrendezvous algorithm

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Stochastic systems in control theory (general) (93E03)

Related Items (9)

Gathering Anonymous, Oblivious Robots on a Grid ⋮ Connectivity-preserving rendezvous of heterogeneous multi-agent systems under denial-of-service attacks ⋮ Connectivity preservation for multi-agent rendezvous with link failure ⋮ Computing by Mobile Robotic Sensors ⋮ RobustL₂ − L_∞consensus control for uncertain high-order multi-agent systems with time-delay ⋮ L₂ − L_∞ Consensus Control for High‐Order Multi‐Agent Systems with Nonuniform Time‐Varying Delays ⋮ Collisionless Gathering of Robots with an Extent ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Practical multiagent rendezvous through modified circumcenter algorithms

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Practical multiagent rendezvous through modified circumcenter algorithms