The Repetition Roadmap for Repetitive Constrained Motion Planning

We present the Repetition Roadmap, a motion planner that effectively exploits the repetitiveness of a set of tasks with small variations to efficiently compute new motions. The method learns an abstract roadmap of probability distributions for the configuration space of a particular task set from previous solution paths. We show how to construct the Repetition Roadmap by learning a Gaussian mixture model and connecting the distribution components based on the connectivity information of the prior paths. We present an algorithm that exploits the information in the Repetition Roadmap to guide the search for solutions of similar tasks. We illustrate our method in a maze, which explains the construction of the Repetition Roadmap and how the method can generalize over different environments. We show how to apply the Repetition Roadmap to similar constrained manipulation tasks and present our results including significant speedup in computation time when compared to uniform and adaptive sampling.

[1]  Marin Kobilarov,et al.  Cross-entropy motion planning , 2012, Int. J. Robotics Res..

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

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

[4]  Oliver Brock,et al.  Elastic roadmaps—motion generation for autonomous mobile manipulation , 2010, Auton. Robots.

[5]  N. Roy,et al.  The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance , 2009, Int. J. Robotics Res..

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

[7]  Siddhartha S. Srinivasa,et al.  Task Space Regions , 2011, Int. J. Robotics Res..

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

[9]  Dylan Hadfield-Menell,et al.  Guided search for task and motion plans using learned heuristics , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[10]  Alin Albu-Schäffer,et al.  Repetition sampling for efficiently planning similar constrained manipulation tasks , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

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

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

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

[14]  Lars-Peter Ellekilde,et al.  Kernel density estimation based self-learning sampling strategy for motion planning of repetitive tasks , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

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

[16]  Nancy M. Amato,et al.  Toggle PRM: Simultaneous mapping of C-free and C-obstacle - A study in 2D - , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Nancy M. Amato,et al.  Improving the connectivity of PRM roadmaps , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[18]  Nicholas Roy,et al.  E-Graphs: Bootstrapping Planning with Experience Graphs , 2013 .

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

[20]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[21]  Oliver Brock,et al.  Incremental, sensor-based motion generation for mobile manipulators in unknown, dynamic environments , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

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

[23]  Ross A. Knepper,et al.  Real-time informed path sampling for motion planning search , 2012, Int. J. Robotics Res..

[24]  Ross A. Knepper,et al.  Path and trajectory diversity: Theory and algorithms , 2008, 2008 IEEE International Conference on Robotics and Automation.

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

[26]  Siddhartha S. Srinivasa,et al.  Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[27]  Yoan Miche,et al.  Mixture Models and EM , 2007 .

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

[29]  Kostas E. Bekris,et al.  Multiple query probabilistic roadmap planning using single query planning primitives , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).