Adapting a Rapidly-Exploring Random Tree for Automated Planning

Rapidly-exploring random trees (RRTs) are data structures and search algorithms designed to be used in continuous path planning problems. They are one of the most successful state-of-the-art techniques as they offer a great degree of flexibility and reliability. However, their use in other search domains has not been thoroughly analyzed. In this work we propose the use of RRTs as a search algorithm for automated planning. We analyze the advantages that this approach has over previously used search algorithms and the challenges of adapting RRTs for implicit and discrete search spaces.

[1]  Marc Schoenauer,et al.  An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning , 2010, ICAPS.

[2]  Malte Helmert,et al.  Concise finite-domain representations for PDDL planning tasks , 2009, Artif. Intell..

[3]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[4]  Jörg Hoffmann,et al.  FF: The Fast-Forward Planning System , 2001, AI Mag..

[5]  Vincent Vidal,et al.  A Lookahead Strategy for Heuristic Search Planning , 2004, ICAPS.

[6]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[7]  Silvia Richter,et al.  The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..

[8]  Wheeler Ruml,et al.  The Joy of Forgetting: Faster Anytime Search via Restarting , 2010, ICAPS.

[9]  Joelle Pineau,et al.  RRT-Plan: A Randomized Algorithm for STRIPS Planning , 2006, ICAPS.

[10]  Daniel Borrajo,et al.  Adding Diversity to Classical Heuristic Planning , 2010, SOCS.

[11]  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).

[12]  Manuela M. Veloso,et al.  Real-Time Randomized Motion Planning for Multiple Domains , 2006, RoboCup.

[13]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

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

[15]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[16]  D. Borrajo,et al.  A Unified View of Cost-Based Heuristics , 2009 .

[17]  Stuart Morgan,et al.  Sampling-based planning for discrete spaces , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[18]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[19]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .