Towards small asymptotically near-optimal roadmaps

An exciting recent development is the definition of sampling-based motion planners which guarantee asymptotic optimality. Nevertheless, roadmaps with this property may grow too large and lead to longer query resolution times. If optimality requirements are relaxed, existing asymptotically near-optimal solutions produce sparser graphs by removing redundant edges. Even these alternatives, however, include all sampled configurations as nodes in the roadmap. This work proposes a method, which can reject redundant samples but does provide asymptotic coverage and connectivity guarantees, while keeping local path costs low. Not adding every sample can significantly reduce the size of the final roadmap. An additional advantage is that it is possible to define a reasonable stopping criterion for the approach inspired by previous methods. To achieve these objectives, the proposed method maintains a dense graph that is used for evaluating the performance of the roadmap with regards to local path costs. Experimental results show that the method indeed provides small roadmaps, allowing for shorter query resolution times. Furthermore, smoothing the final paths results in an even more advantageous comparison against alternatives with regards to path quality.

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

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

[3]  Kostas E. Bekris,et al.  Computing spanners of asymptotically optimal probabilistic roadmaps , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[5]  Oliver Brock,et al.  Structural Improvement Filtering Strategy for PRM , 2009 .

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

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

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

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

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

[11]  Emilio Frazzoli,et al.  Incremental Sampling-based Algorithms for Optimal Motion Planning , 2010, Robotics: Science and Systems.

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

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

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

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

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

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

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

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

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

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

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

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

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

[25]  Marin Kobilarov,et al.  Cross-Entropy Randomized Motion Planning , 2011, Robotics: Science and Systems.

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

[27]  Sebastian Thrun,et al.  Anytime search in dynamic graphs , 2008, Artif. Intell..

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

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

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

[31]  Alejandro A. Schäffer,et al.  Graph spanners , 1989, J. Graph Theory.

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

[33]  Leonidas J. Guibas,et al.  Deformable spanners and applications. , 2006, Computational geometry : theory and applications.

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