Safe Interval RRT* for Scalable Multi-Robot Path Planning in Continuous Space

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Sim, Joonyeol, Kim, Joonkyung, Nam, Changjoo
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912227426041856
author Sim, Joonyeol
Kim, Joonkyung
Nam, Changjoo
author_facet Sim, Joonyeol
Kim, Joonkyung
Nam, Changjoo
contents In this paper, we consider the problem of Multi-Robot Path Planning (MRPP) in continuous space. The difficulty of the problem arises from the extremely large search space caused by the combinatorial nature of the problem and the continuous state space. We propose a two-level approach where the low level is a sampling-based planner Safe Interval RRT* (SI-RRT*) that finds a collision-free trajectory for individual robots. The high level can use any method that can resolve inter-robot conflicts where we employ two representative methods that are Prioritized Planning (SI-CPP) and Conflict Based Search (SI-CCBS). Experimental results show that SI-RRT* can quickly find a high-quality solution with a few samples. SI-CPP exhibits improved scalability while SI-CCBS produces higher-quality solutions compared to the state-of-the-art planners for continuous space.
format Preprint
id arxiv_https___arxiv_org_abs_2404_01752
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Safe Interval RRT* for Scalable Multi-Robot Path Planning in Continuous Space
Sim, Joonyeol
Kim, Joonkyung
Nam, Changjoo
Robotics
Artificial Intelligence
Multiagent Systems
In this paper, we consider the problem of Multi-Robot Path Planning (MRPP) in continuous space. The difficulty of the problem arises from the extremely large search space caused by the combinatorial nature of the problem and the continuous state space. We propose a two-level approach where the low level is a sampling-based planner Safe Interval RRT* (SI-RRT*) that finds a collision-free trajectory for individual robots. The high level can use any method that can resolve inter-robot conflicts where we employ two representative methods that are Prioritized Planning (SI-CPP) and Conflict Based Search (SI-CCBS). Experimental results show that SI-RRT* can quickly find a high-quality solution with a few samples. SI-CPP exhibits improved scalability while SI-CCBS produces higher-quality solutions compared to the state-of-the-art planners for continuous space.
title Safe Interval RRT* for Scalable Multi-Robot Path Planning in Continuous Space
topic Robotics
Artificial Intelligence
Multiagent Systems
url https://arxiv.org/abs/2404.01752