dRRT*

Scalable and informed asymptotically-optimal multi-robot motion planning

Rahul Shome, Kiril Solovey, Andrew Dobson, Dan Halperin, Kostas Bekris

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Many exciting robotic applications require multiple robots with many degrees of freedom, such as manipulators, to coordinate their motion in a shared workspace. Discovering high-quality paths in such scenarios can be achieved, in principle, by exploring the composite space of all robots. Sampling-based planners do so by building a roadmap or a tree data structure in the corresponding configuration space and can achieve asymptotic optimality. The hardness of motion planning, however, renders the explicit construction of such structures in the composite space of multiple robots impractical. This work proposes a scalable solution for such coupled multi-robot problems, which provides desirable path-quality guarantees and is also computationally efficient. In particular, the proposed dRRT is an informed, asymptotically-optimal extension of a prior sampling-based multi-robot motion planner, dRRT. The prior approach introduced the idea of building roadmaps for each robot and implicitly searching the tensor product of these structures in the composite space. This work identifies the conditions for convergence to optimal paths in multi-robot problems, which the prior method was not achieving. Building on this analysis, dRRT is first properly adapted so as to achieve the theoretical guarantees and then further extended so as to make use of effective heuristics when searching the composite space of all robots. The case where the various robots share some degrees of freedom is also studied. Evaluation in simulation indicates that the new algorithm, dRRT converges to high-quality paths quickly and scales to a higher number of robots where various alternatives fail. This work also demonstrates the planner’s capability to solve problems involving multiple real-world robotic arms.

Original languageEnglish (US)
JournalAutonomous Robots
DOIs
StateAccepted/In press - Jan 1 2019

Fingerprint

Motion planning
Robots
Composite materials
Sampling
Robotic arms
Degrees of freedom (mechanics)
Manipulators
Tensors
Data structures
Robotics
Hardness

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Keywords

  • Asymptotic optimality
  • Motion planning
  • Multi-arm motion planning
  • Multi-robot motion planning
  • Multi-robot problems
  • Sampling-based motion planning

Cite this

Shome, Rahul ; Solovey, Kiril ; Dobson, Andrew ; Halperin, Dan ; Bekris, Kostas. / dRRT* : Scalable and informed asymptotically-optimal multi-robot motion planning. In: Autonomous Robots. 2019.
@article{2c36c7e9a2e54a07a3c2f9f86887345a,
title = "dRRT*: Scalable and informed asymptotically-optimal multi-robot motion planning",
abstract = "Many exciting robotic applications require multiple robots with many degrees of freedom, such as manipulators, to coordinate their motion in a shared workspace. Discovering high-quality paths in such scenarios can be achieved, in principle, by exploring the composite space of all robots. Sampling-based planners do so by building a roadmap or a tree data structure in the corresponding configuration space and can achieve asymptotic optimality. The hardness of motion planning, however, renders the explicit construction of such structures in the composite space of multiple robots impractical. This work proposes a scalable solution for such coupled multi-robot problems, which provides desirable path-quality guarantees and is also computationally efficient. In particular, the proposed dRRT∗ is an informed, asymptotically-optimal extension of a prior sampling-based multi-robot motion planner, dRRT. The prior approach introduced the idea of building roadmaps for each robot and implicitly searching the tensor product of these structures in the composite space. This work identifies the conditions for convergence to optimal paths in multi-robot problems, which the prior method was not achieving. Building on this analysis, dRRT is first properly adapted so as to achieve the theoretical guarantees and then further extended so as to make use of effective heuristics when searching the composite space of all robots. The case where the various robots share some degrees of freedom is also studied. Evaluation in simulation indicates that the new algorithm, dRRT∗ converges to high-quality paths quickly and scales to a higher number of robots where various alternatives fail. This work also demonstrates the planner’s capability to solve problems involving multiple real-world robotic arms.",
keywords = "Asymptotic optimality, Motion planning, Multi-arm motion planning, Multi-robot motion planning, Multi-robot problems, Sampling-based motion planning",
author = "Rahul Shome and Kiril Solovey and Andrew Dobson and Dan Halperin and Kostas Bekris",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/s10514-019-09832-9",
language = "English (US)",
journal = "Autonomous Robots",
issn = "0929-5593",
publisher = "Springer Netherlands",

}

dRRT* : Scalable and informed asymptotically-optimal multi-robot motion planning. / Shome, Rahul; Solovey, Kiril; Dobson, Andrew; Halperin, Dan; Bekris, Kostas.

In: Autonomous Robots, 01.01.2019.

Research output: Contribution to journalArticle

TY - JOUR

T1 - dRRT*

T2 - Scalable and informed asymptotically-optimal multi-robot motion planning

AU - Shome, Rahul

AU - Solovey, Kiril

AU - Dobson, Andrew

AU - Halperin, Dan

AU - Bekris, Kostas

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Many exciting robotic applications require multiple robots with many degrees of freedom, such as manipulators, to coordinate their motion in a shared workspace. Discovering high-quality paths in such scenarios can be achieved, in principle, by exploring the composite space of all robots. Sampling-based planners do so by building a roadmap or a tree data structure in the corresponding configuration space and can achieve asymptotic optimality. The hardness of motion planning, however, renders the explicit construction of such structures in the composite space of multiple robots impractical. This work proposes a scalable solution for such coupled multi-robot problems, which provides desirable path-quality guarantees and is also computationally efficient. In particular, the proposed dRRT∗ is an informed, asymptotically-optimal extension of a prior sampling-based multi-robot motion planner, dRRT. The prior approach introduced the idea of building roadmaps for each robot and implicitly searching the tensor product of these structures in the composite space. This work identifies the conditions for convergence to optimal paths in multi-robot problems, which the prior method was not achieving. Building on this analysis, dRRT is first properly adapted so as to achieve the theoretical guarantees and then further extended so as to make use of effective heuristics when searching the composite space of all robots. The case where the various robots share some degrees of freedom is also studied. Evaluation in simulation indicates that the new algorithm, dRRT∗ converges to high-quality paths quickly and scales to a higher number of robots where various alternatives fail. This work also demonstrates the planner’s capability to solve problems involving multiple real-world robotic arms.

AB - Many exciting robotic applications require multiple robots with many degrees of freedom, such as manipulators, to coordinate their motion in a shared workspace. Discovering high-quality paths in such scenarios can be achieved, in principle, by exploring the composite space of all robots. Sampling-based planners do so by building a roadmap or a tree data structure in the corresponding configuration space and can achieve asymptotic optimality. The hardness of motion planning, however, renders the explicit construction of such structures in the composite space of multiple robots impractical. This work proposes a scalable solution for such coupled multi-robot problems, which provides desirable path-quality guarantees and is also computationally efficient. In particular, the proposed dRRT∗ is an informed, asymptotically-optimal extension of a prior sampling-based multi-robot motion planner, dRRT. The prior approach introduced the idea of building roadmaps for each robot and implicitly searching the tensor product of these structures in the composite space. This work identifies the conditions for convergence to optimal paths in multi-robot problems, which the prior method was not achieving. Building on this analysis, dRRT is first properly adapted so as to achieve the theoretical guarantees and then further extended so as to make use of effective heuristics when searching the composite space of all robots. The case where the various robots share some degrees of freedom is also studied. Evaluation in simulation indicates that the new algorithm, dRRT∗ converges to high-quality paths quickly and scales to a higher number of robots where various alternatives fail. This work also demonstrates the planner’s capability to solve problems involving multiple real-world robotic arms.

KW - Asymptotic optimality

KW - Motion planning

KW - Multi-arm motion planning

KW - Multi-robot motion planning

KW - Multi-robot problems

KW - Sampling-based motion planning

UR - http://www.scopus.com/inward/record.url?scp=85060722591&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85060722591&partnerID=8YFLogxK

U2 - 10.1007/s10514-019-09832-9

DO - 10.1007/s10514-019-09832-9

M3 - Article

JO - Autonomous Robots

JF - Autonomous Robots

SN - 0929-5593

ER -