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

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 waypoints. 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.
Type de document :
Communication dans un congrès
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Sep 2014, Chicago, United States. 6 p., 2014
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01057030
Contributeur : Didier Devaurs <>
Soumis le : jeudi 21 août 2014 - 11:24:48
Dernière modification le : mercredi 11 janvier 2017 - 01:04:06
Document(s) archivé(s) le : jeudi 27 novembre 2014 - 12:45:49

Identifiants

  • HAL Id : hal-01057030, version 1

Citation

Didier Devaurs, Thierry Siméon, Juan Cortés. A multi-tree extension of the Transition-based RRT: Application to ordering-and-pathfinding problems in continuous cost spaces. IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Sep 2014, Chicago, United States. 6 p., 2014. 〈hal-01057030〉

Partager

Métriques

Consultations de
la notice

214

Téléchargements du document

231