Using Local Experiences for Global Motion Planning

Sampling-based planners are effective in many real-world applications such as robotics manipulation, navigation, and even protein modeling. However, it is often challenging to generate a collision-free path in environments where key areas are hard to sample. In the absence of any prior information, sampling-based planners are forced to explore uniformly or heuristically, which can lead to degraded performance. One way to improve performance is to use prior knowledge of environments to adapt the sampling strategy to the problem at hand. In this work, we decompose the workspace into local primitives, memorizing local experiences by these primitives in the form of local samplers, and store them in a database. We synthesize an efficient global sampler by retrieving local experiences relevant to the given situation. Our method transfers knowledge effectively between diverse environments that share local primitives and speeds up the performance dramatically. Our results show, in terms of solution time, an improvement of multiple orders of magnitude in two traditionally challenging high-dimensional problems compared to state-of-the-art approaches.

[1]  Mark H. Overmars,et al.  Creating High-quality Paths for Motion Planning , 2007, Int. J. Robotics Res..

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

[3]  Kei Okada,et al.  Experience-based planning with sparse roadmap spanners , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[4]  Panagiotis Tsiotras,et al.  Machine learning guided exploration for sampling-based motion planning algorithms , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

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

[6]  Dmitry Berenson,et al.  A robot path planning framework that learns from experience , 2012, 2012 IEEE International Conference on Robotics and Automation.

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

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

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

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

[11]  Daniel King,et al.  Fetch & Freight : Standard Platforms for Service Robot Applications , 2016 .

[12]  Lydia E. Kavraki,et al.  Benchmarking Motion Planning Algorithms: An Extensible Infrastructure for Analysis and Visualization , 2014, IEEE Robotics & Automation Magazine.

[13]  James J. Kuffner,et al.  Adaptive workspace biasing for sampling-based planners , 2008, 2008 IEEE International Conference on Robotics and Automation.

[14]  Jyh-Ming Lien,et al.  Planning motion in environments with similar obstacles , 2009, Robotics: Science and Systems.

[15]  Marco Pavone,et al.  Learning Sampling Distributions for Robot Motion Planning , 2017, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[16]  Maxim Likhachev,et al.  E-Graphs: Bootstrapping Planning with Experience Graphs , 2012, SOCS.

[17]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[18]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[19]  Rajeev Motwani,et al.  Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.

[20]  John Canny,et al.  The complexity of robot motion planning , 1988 .

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

[22]  Swarat Chaudhuri,et al.  An incremental constraint-based framework for task and motion planning , 2018, Int. J. Robotics Res..

[23]  Alin Albu-Schäffer,et al.  The Repetition Roadmap for Repetitive Constrained Motion Planning , 2018, IEEE Robotics and Automation Letters.

[24]  Marc Toussaint,et al.  Fast motion planning from experience: trajectory prediction for speeding up movement generation , 2013, Auton. Robots.

[25]  Leslie Pack Kaelbling,et al.  Learning to guide task and motion planning using score-space representation , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[26]  Oliver Brock,et al.  Adapting the sampling distribution in PRM planners based on an approximated medial axis , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[27]  Oliver Brock,et al.  Toward Optimal Configuration Space Sampling , 2005, Robotics: Science and Systems.

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