Authors: Samuel Rodriguez, Xinyu Tang, Jyh-Ming Lien, Nancy M. Amato

Venue: In Proc. IEEE International Conference on Robotics and Automation (ICRA)
DOI: 10.1109/ROBOT.2006.1641823
Link to Publication

Find PDF here: 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 

@inproceedings{Rodriguez-aorrt-2006, 
 author = { {Rodriguez} and  {Xinyu Tang} and  {Jyh-Ming Lien} and N. M. {Amato}}, 
 booktitle = {Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.}, 
 doi = {10.1109/ROBOT.2006.1641823}, 
 number = {}, 
 pages = {895-900}, 
 title = {An obstacle-based rapidly-exploring random tree}, 
 volume = {}, 
 year = {2006} 
}