Home /Research /RDT<sup>+</sup>: A parameter-free algorithm for exact motion planning
OTHER

RDT<sup>+</sup>: A parameter-free algorithm for exact motion planning

Nikolaus Vahrenkamp, Peter Kaiser, Tamim Asfour, Rüdiger Dillmann

Year
2011
Citations
12

Abstract

In this paper parameter-free concepts for exact motion planning are investigated. With the proposed RDT <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sup> approach the collision detection parameters of a Rapidly exploring Dense Tree (RDT) are automatically adjusted until an exact solution can be found. For efficient planning discrete collision detection routines are used within the RDT planner and by verifying the results with exact collision detection methods, the RDT+ concept allows to compute motions that are guaranteed collision-free. We show the probabilistic completeness of the proposed planner and present an extension for handling narrow passages. The algorithms are evaluated in different experiments, including narrow passages and high-dimensional planning problems, that are solved in simulation and on the humanoid robot ARMAR-III.

Keywords

Motion planningAlgorithmCollision detectionPlannerCompleteness (order theory)Probabilistic logicComputer scienceCollisionRobotTree (set theory)

Related papers

Browse all OTHER papers