Merry-Go-Round: Safe Control of Decentralized Multi-Robot Systems with Deadlock Prevention

We propose a hybrid approach for decentralized multi-robot navigation that ensures both safety and deadlock prevention. Building on a standard control formulation, we add a lightweight deadlock prevention mechanism by forming temporary "roundabouts" (circular reference paths). Each robot relies only on local, peer-to-peer communication and a controller for base collision avoidance; a roundabout is generated or joined on demand to avert deadlocks. Robots in the roundabout travel in one direction until an escape condition is met, allowing them to return to goal-oriented motion. Unlike classical decentralized methods that lack explicit deadlock resolution, our roundabout maneuver ensures system-wide forward progress while preserving safety constraints. Extensive simulations and physical robot experiments show that our method consistently outperforms or matches the success and arrival rates of other decentralized control approaches, particularly in cluttered or high-density scenarios, all with minimal centralized coordination.

Authors

Institutions

Publication Details

Published
2025-10-19
DOI
https://doi.org/10.1109/iros60139.2025.11245826
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Merry-Go-Round: Safe Control of Decentralized Multi-Robot Systems with Deadlock Prevention

Joonkyung Kim, Wenhao Luo, Changjoo Nam, Wonjong Lee et al.
Robotic Path Planning Algorithms
article

Merry-Go-Round: Safe Control of Decentralized Multi-Robot Systems with Deadlock Prevention

Joonkyung Kim, Wenhao Luo, Changjoo Nam, Wonjong Lee, Joonyeol Sim, Siwon Jo
article en

Abstract

We propose a hybrid approach for decentralized multi-robot navigation that ensures both safety and deadlock prevention. Building on a standard control formulation, we add a lightweight deadlock prevention mechanism by forming temporary "roundabouts" (circular reference paths). Each robot relies only on local, peer-to-peer communication and a controller for base collision avoidance; a roundabout is generated or joined on demand to avert deadlocks. Robots in the roundabout travel in one direction until an escape condition is met, allowing them to return to goal-oriented motion. Unlike classical decentralized methods that lack explicit deadlock resolution, our roundabout maneuver ensures system-wide forward progress while preserving safety constraints. Extensive simulations and physical robot experiments show that our method consistently outperforms or matches the success and arrival rates of other decentralized control approaches, particularly in cluttered or high-density scenarios, all with minimal centralized coordination.

Sogang University (KR), University of Illinois Chicago (US), University of Chicago (US), Artificial Intelligence in Medicine (Canada) (CA)
Openalex Percentile: Top 62%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Merry-Go-Round: Safe Control of Decentralized Multi-Robot Systems with Deadlock Prevention — Joonkyung Kim, Wenhao Luo, et al. · (2025) | TGRS Research Map | TGRS