Computing spanners of asymptotically optimal probabilistic roadmaps

Asymptotically optimal motion planning algorithms guarantee solutions that approach optimal as more iterations are performed. Nevertheless, roadmaps with this property can grow too large and unwieldy for fast online query resolution. In graph theory there are many algorithms that produce subgraphs, known as spanners, which have guarantees about path quality. Applying such an algorithm to a dense, asymptotically optimal roadmap produces a sparse, asymptotically near optimal roadmap. Experiments performed on typical, geometric problems in SE(3) show that a large reduction in roadmap edges can be achieved with a small increase in path length. Online queries are answered much more quickly with similar results in terms of path quality. This also motivates future work that applies the technique incrementally so edges that won't increase path quality will never be added to the roadmap and won't be checked for collisions.

[1]  Sandeep Sen,et al.  A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.

[2]  Mark H. Overmars,et al.  Creating small roadmaps for solving motion planning problems , 2005 .

[3]  J. Mark Keil,et al.  Approximating the Complete Euclidean Graph , 1988, Scandinavian Workshop on Algorithm Theory.

[4]  Thierry Siméon,et al.  Visibility-based probabilistic roadmaps for motion planning , 2000, Adv. Robotics.

[5]  Kostas E. Bekris,et al.  Asymptotically Near-Optimal Is Good Enough for Motion Planning , 2011, ISRR.

[6]  Maja J. Mataric,et al.  Motion planning using dynamic roadmaps , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[8]  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..

[9]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[10]  David Peleg,et al.  Strong Inapproximability of the Basic k-Spanner Problem , 2000, ICALP.

[11]  Giri Narasimhan,et al.  Fast algorithms for constructing t-spanners and paths with stretch t , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Xiaojun Wu,et al.  DAvinCi: A cloud computing framework for service robots , 2010, 2010 IEEE International Conference on Robotics and Automation.

[13]  Mark H. Overmars,et al.  Reachability-based analysis for Probabilistic Roadmap planners , 2007, Robotics Auton. Syst..

[14]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[15]  Mark H. Overmars,et al.  Useful cycles in probabilistic roadmap graphs , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[16]  Nancy M. Amato,et al.  Incremental Map Generation (IMG) , 2006, WAFR.

[17]  Mikkel Thorup,et al.  Deterministic Constructions of Approximate Distance Oracles and Spanners , 2005, ICALP.

[18]  GeraertsRoland,et al.  Reachability-based analysis for Probabilistic Roadmap planners , 2007 .

[19]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[20]  Leonidas J. Guibas,et al.  A probabilistic roadmap planner for flexible objects with a workspace medial-axis-based sampling approach , 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289).

[21]  Emilio Frazzoli,et al.  Anytime Motion Planning using the RRT* , 2011, 2011 IEEE International Conference on Robotics and Automation.

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

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

[24]  Mark H. Overmars,et al.  Creating High-quality Roadmaps for Motion Planning in Virtual Environments , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[25]  Jean-Claude Latombe,et al.  A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking , 2001, ISRR.

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

[27]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[28]  Nancy M. Amato,et al.  Extracting optimal paths from roadmaps for motion planning , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[29]  Kostas E. Bekris,et al.  Learning approximate cost-to-go metrics to improve sampling-based motion planning , 2011, 2011 IEEE International Conference on Robotics and Automation.

[30]  Thierry Siméon,et al.  Path Deformation Roadmaps , 2006, WAFR.

[31]  Jur P. van den Berg,et al.  Planning High-quality Paths and Corridors Amidst Obstacles , 2008, Int. J. Robotics Res..

[32]  Dan Halperin,et al.  Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners , 2010, WAFR.

[33]  Didier Wolf,et al.  Capture of homotopy classes with probabilistic road map , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[34]  Martin Barland.  Motion Planning Framework for Industrial Manipulators using the Open Motion Planning Library (OMPL) , 2012 .

[35]  Nancy M. Amato,et al.  Structural Improvement Filtering Strategy for PRM , 2008, Robotics: Science and Systems.

[36]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[37]  Lenore Cowen,et al.  Near-Linear Time Construction of Sparse Neighborhood Covers , 1999, SIAM J. Comput..

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

[39]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[40]  Jur P. van den Berg,et al.  Anytime path planning and replanning in dynamic environments , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[41]  Dan Halperin,et al.  A Little More, a Lot Better: Improving Path Quality by a Path-Merging Algorithm , 2011, IEEE Transactions on Robotics.

[42]  Kostas E. Bekris,et al.  Informed and probabilistically complete search for motion planning under differential constraints , 2008, AAAI 2008.

[43]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.