Parallelizing RRT on distributed-memory architectures

Didier Devaurs*, Thierry Siméon, Juan Cortés

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

34 Citations (Scopus)

Abstract

This paper addresses the problem of improving the performance of the Rapidly-exploring Random Tree (RRT) algorithm by parallelizing it. For scalability reasons we do so on a distributed-memory architecture, using the message-passing paradigm. We present three parallel versions of RRT along with the technicalities involved in their implementation. We also evaluate the algorithms and study how they behave on different motion planning problems.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Robotics and Automation
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages2261-2266
Number of pages6
ISBN (Electronic)9781612843858
ISBN (Print)9781612843865
DOIs
Publication statusPublished - 18 Aug 2011
Event2011 IEEE International Conference on Robotics and Automation, ICRA 2011 - Shanghai, China
Duration: 9 May 201113 May 2011

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
ISSN (Print)1050-4729

Conference

Conference2011 IEEE International Conference on Robotics and Automation, ICRA 2011
Country/TerritoryChina
CityShanghai
Period9/05/1113/05/11

Keywords

  • distributed memory
  • message passing
  • parallel algorithms
  • path planning
  • rapidly-exploring random tree (RRT)

Fingerprint

Dive into the research topics of 'Parallelizing RRT on distributed-memory architectures'. Together they form a unique fingerprint.

Cite this