A multi-tree extension of the transition-based RRT: application to ordering-and-pathfinding problems in continuous cost spaces

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

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

38 Citations (Scopus)

Abstract

The Transition-based RRT (T-RRT) is a variant of RRT developed for path planning on a continuous cost space, i.e. a configuration space featuring a continuous cost function. It has been used to solve complex, high-dimensional problems in robotics and structural biology. In this paper, we propose a multiple-tree variant of T-RRT, named Multi-T-RRT. It is especially useful to solve ordering-and-pathfinding problems, i.e. to compute a path going through several unordered way-points. Using the Multi-T-RRT, such problems can be solved from a purely geometrical perspective, without having to use a symbolic task planner. We evaluate the Multi-T-RRT on several path planning problems and compare it to other path planners. Finally, we apply the Multi-T-RRT to a concrete industrial inspection problem involving an aerial robot.

Original languageEnglish
Title of host publication2014 IEEE/RSJ International Conference on Intelligent Robots and Systems
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages2991-2996
Number of pages6
ISBN (Electronic)9781479969340
DOIs
Publication statusPublished - 6 Nov 2014
Event2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2014 - Chicago, United States
Duration: 14 Sept 201418 Sept 2014

Publication series

NameIEEE International Conference on Intelligent Robots and Systems
ISSN (Print)2153-0858
ISSN (Electronic)2153-0866

Conference

Conference2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2014
Country/TerritoryUnited States
CityChicago
Period14/09/1418/09/14

Keywords

  • path planning
  • inspection
  • cost function
  • planning
  • service robots
  • engines

Fingerprint

Dive into the research topics of 'A multi-tree extension of the transition-based RRT: application to ordering-and-pathfinding problems in continuous cost spaces'. Together they form a unique fingerprint.

Cite this