Home research People General Info Seminars Resources Intranet
Abstract

Samuel Rodriguez, Xinyu Tang, Jyh-Ming Lien, Nancy M. Amato, "An Obstacle-Based Rapidly-Exploring Random Tree," In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pp. 895-900, Orlando, FL, May 2006.
Proceedings(ps, pdf, abstract)

Tree-based path planners have been shown to be well suited to solve various high dimensional motion planning problems. Here we present a variant of the Rapidly-Exploring Random Tree (RRT) path planning algorithm that is able to explore narrow passages or difficult areas more effectively. We show that both workspace obstacle information and C-space information can be used when deciding which direction to grow. The method includes many ways to grow the tree, some taking into account the obstacles in the environment. This planner works best in difficult areas when planning for free flying rigid or articulated robots. Indeed, whereas the standard RRT can face difficulties planning in a narrow passage, the tree based planner presented here works best in these areas.