Cost based planning with RRT in outdoor environments

The Rapidly Exploring Random Tree (RRT) algorithm can be applied to the robotic path planning problem and performs well in challenging, dynamic domains. Traditional RRT methods use a binary cost function and they select portions of the tree for expansion based on the Euclidean distance to the target. However, in outdoor navigation, the relative cost of terrain can also provide useful input to a planning algorithm that traditional RRT methods cannot take advantage of. We present the Metric Adaptive RRT (MA-RRT), which integrates planning and fast execution for generating paths over a cost map. The MA-RRT algorithm considers underlying cost of a path when calculating the distance function for tree expansion. A heuristic value is also used for determining distance from a point to the target and an adaptive mechanism is employed for adjusting the heuristic on-line. We have implemented our approach in offline simulations and in outdoor robot experiments, and show that the MA-RRT algorithm can improve upon the quality of the path returned when cost is considered. The trade off between cost consideration and runtime performance is also presented.

[1]  Reid G. Simmons,et al.  Approaches for heuristically biasing RRT growth , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[2]  David Wooden,et al.  A guide to vision-based map building , 2006, IEEE Robotics & Automation Magazine.

[3]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[4]  Manuela M. Veloso,et al.  Real-Time Randomized Path Planning for Robot Navigation , 2002, RoboCup.

[5]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[6]  James M. Rehg,et al.  Learning from examples in unstructured, outdoor environments , 2006, J. Field Robotics.

[7]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[8]  Anthony Stentz Optimal and Efficient Path Planning for Unknown and Dynamic Environments , 1993 .

[9]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[10]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[11]  Magnus Egerstedt,et al.  Control-driven mapping and planning , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[12]  Anthony Stentz,et al.  Anytime RRTs , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.