Spark PRM: Using RRTs within PRMs to efficiently explore narrow passages

Probabilistic RoadMaps (PRMs) have been successful for many high-dimensional motion planning problems. However, they encounter difficulties when mapping narrow passages. While many PRM sampling methods have been proposed to increase the proportion of samples within narrow passages, such difficult planning areas still pose many challenges. We introduce a novel algorithm, Spark PRM, that sparks the growth of Rapidly-expanding Random Trees (RRTs) from narrow passage samples generated by a PRM. The RRT rapidly generates further narrow passage samples, ideally until the passage is fully mapped. After reaching a terminating condition, the tree stops growing and is added to the roadmap. Spark PRM is a general method that can be applied to all PRM variants. We study the benefits of Spark PRM with a variety of sampling strategies in a wide array of environments. We show significant speedups in computation time over RRT, Sampling-based Roadmap of Trees (SRT), and various PRM variants.

[1]  Nancy M. Amato,et al.  Shepherding behaviors , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[3]  Nancy M. Amato,et al.  The STAPL parallel container framework , 2011, PPoPP '11.

[4]  Nancy M. Amato,et al.  An obstacle-based rapidly-exploring random tree , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[5]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[6]  Jean-Claude Latombe,et al.  Multi-modal Motion Planning in Non-expansive Spaces , 2010, Int. J. Robotics Res..

[7]  Dinesh Manocha,et al.  An efficient retraction-based RRT planner , 2008, 2008 IEEE International Conference on Robotics and Automation.

[8]  M. Strandberg,et al.  Augmenting RRT-planners with local trees , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[9]  Jean-Claude Latombe,et al.  On the Probabilistic Foundations of Probabilistic Roadmap Planning , 2006, Int. J. Robotics Res..

[10]  Nancy M. Amato,et al.  UOBPRM: A uniformly distributed obstacle-based PRM , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  David Hsu,et al.  The bridge test for sampling narrow passages with probabilistic roadmap planners , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[12]  Nancy M. Amato,et al.  A general framework for sampling on the medial axis of the free space , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[13]  Jean-Claude Latombe,et al.  Multi-modal Motion Planning in Non-expansive Spaces , 2010, Int. J. Robotics Res..

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

[15]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[16]  Nancy M. Amato,et al.  Adapting RRT growth for heterogeneous environments , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Jean-Claude Latombe,et al.  Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..

[18]  Kostas E. Bekris,et al.  Sampling-based roadmap of trees for parallel motion planning , 2005, IEEE Transactions on Robotics.

[19]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[20]  Nancy M. Amato,et al.  MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[21]  Nancy M. Amato,et al.  Metrics for analyzing the evolution of C-space models , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[22]  Nancy M. Amato,et al.  Toggle PRM: A Coordinated Mapping of C-Free and C-Obstacle in Arbitrary Dimension , 2012, WAFR.

[23]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[25]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[26]  Nancy M. Amato,et al.  Using Motion Planning to Study Protein Folding Pathways , 2002, J. Comput. Biol..

[27]  A WesleyMichael,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979 .

[28]  Dinesh Manocha,et al.  Fast distance queries with rectangular swept sphere volumes , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[29]  Nancy M. Amato,et al.  Enhancing Randomized Motion Planners: Exploring with Haptic Hints , 2001, Auton. Robots.