DREAM: Decentralized Real-Time Asynchronous Probabilistic Trajectory Planning for Collision-Free Multirobot Navigation in Cluttered Environments

Collision-free navigation in cluttered environments with static and dynamic obstacles is essential for many multirobot tasks. Dynamic obstacles may also be interactive, i.e., their behavior varies based on the behavior of other entities. We propose a novel representation for interactive behavior of dynamic obstacles and a decentralized real-time multirobot trajectory planning algorithm allowing interrobot collision avoidance as well as static and dynamic obstacle avoidance. Our planner simulates the behavior of dynamic obstacles, accounting for interactivity. We account for the perception inaccuracy of static and prediction inaccuracy of dynamic obstacles. We handle asynchronous planning between teammates and message delays, drops, and reorderings. We evaluate our algorithm in simulations using 25400 random cases and compare it against three state-of-the-art baselines using 2100 random cases. Our algorithm achieves up to 1.68× success rate using as low as 0.28× time in single-robot, and up to 2.15× success rate using as low as 0.36× time in multirobot cases compared to the best baseline. We implement our planner on real quadrotors to show its real-world applicability.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Robotics
Published
2024-11-29
DOI
https://doi.org/10.1109/tro.2024.3509015
Citations
10
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DREAM: Decentralized Real-Time Asynchronous Probabilistic Trajectory Planning for Collision-Free Multirobot Navigation in Cluttered Environments

Baskın Şenbaşlar, Gaurav S. Sukhatme
10 citations
IEEE Transactions on Robotics
Robotic Path Planning Algorithms
2.49
article

DREAM: Decentralized Real-Time Asynchronous Probabilistic Trajectory Planning for Collision-Free Multirobot Navigation in Cluttered Environments

Baskın Şenbaşlar, Gaurav S. Sukhatme
article en
10 citations

Abstract

Collision-free navigation in cluttered environments with static and dynamic obstacles is essential for many multirobot tasks. Dynamic obstacles may also be interactive, i.e., their behavior varies based on the behavior of other entities. We propose a novel representation for interactive behavior of dynamic obstacles and a decentralized real-time multirobot trajectory planning algorithm allowing interrobot collision avoidance as well as static and dynamic obstacle avoidance. Our planner simulates the behavior of dynamic obstacles, accounting for interactivity. We account for the perception inaccuracy of static and prediction inaccuracy of dynamic obstacles. We handle asynchronous planning between teammates and message delays, drops, and reorderings. We evaluate our algorithm in simulations using 25400 random cases and compare it against three state-of-the-art baselines using 2100 random cases. Our algorithm achieves up to 1.68× success rate using as low as 0.28× time in single-robot, and up to 2.15× success rate using as low as 0.36× time in multirobot cases compared to the best baseline. We implement our planner on real quadrotors to show its real-world applicability.

IEEE Transactions on RoboticsVol. 41
University of Southern California (US), Nvidia (United States) (US)
Climate action
Openalex Percentile: Top 9%
Robotic Path Planning Algorithms
2.49
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.