Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints
Not on the map. Why?
Abstract (arXiv)
In this paper, we present a learning approach to goal assignment and trajectory planning for unlabeled robots operating in 2D, obstacle-filled workspaces. More specifically, we tackle the unlabeled multi-robot motion planning problem with motion constraints as a multi-agent reinforcement learning problem with some sparse global reward. In contrast with previous works, which formulate an entirely new hand-crafted optimization cost or trajectory generation algorithm for a different robot dynamic model, our framework is a general approach that is applicable to arbitrary robot models. Further, by using the velocity obstacle, we devise a smooth projection that guarantees collision free trajectories for all robots with respect to their neighbors and obstacles. The efficacy of our algorithm is demonstrated through varied simulations.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 0; 2023: 0; 2024: 0; 2025: 1.
4 papers.
- 2021Neurosymbolic Transformers for Multi-Agent Communicationcited by 13
- 2021Large Scale Distributed Collaborative Unlabeled Motion Planning with Graph Policy Gradientscited by 5
- 2021Safe Deep Reinforcement Learning for Multi-Agent Systems with Continuous Action Spacescited by 5
- 2025Turn-based Multi-Agent Reinforcement Learning Model Checkingcited by 3
- 2025Turn-based Multi-Agent Reinforcement Learning Model Checking6 Jan 2025
- 2021Safe Deep Reinforcement Learning for Multi-Agent Systems with Continuous Action Spaces9 Aug 2021
- 2021Large Scale Distributed Collaborative Unlabeled Motion Planning with Graph Policy Gradients11 Feb 2021
- 2021Neurosymbolic Transformers for Multi-Agent Communication5 Jan 2021