Sampling-Based Motion Planning on Manifold Sequences

We address the problem of planning robot motions in constrained configuration spaces where the constraints change throughout the motion. A novel problem formulation is introduced that describes a task as a sequence of intersecting manifolds, which the robot needs to traverse in order to solve the task. We specify a class of sequential motion planning problems that fulfill a particular property of the change in the free configuration space when transitioning between manifolds. For this problem class, a sequential motion planning algorithm SMP is developed that searches for optimal intersection points between manifolds by using RRT* in an inner loop with a novel steering strategy. We provide a theoretical analysis regarding its probabilistic completeness and demonstrate its performance on kinematic planning problems where the constraints are represented as geometric primitives. Further, we show its capabilities on solving multi-robot object transportation tasks.

[1]  Swarat Chaudhuri,et al.  Incremental Task and Motion Planning: A Constraint-Based Approach , 2016, Robotics: Science and Systems.

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

[3]  Nicholas Roy,et al.  Asymptotically Optimal Planning under Piecewise-Analytic Constraints , 2016, WAFR.

[4]  Thierry Siméon,et al.  Manipulation Planning with Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[5]  Mike Stilman,et al.  Task constrained motion planning in robot joint space , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Lydia E. Kavraki,et al.  Sampling-Based Methods for Motion Planning with Constraints , 2018, Annu. Rev. Control. Robotics Auton. Syst..

[7]  Léonard Jaillet,et al.  Path Planning Under Kinematic Constraints by Rapidly Exploring Manifolds , 2013, IEEE Transactions on Robotics.

[8]  Siddhartha S. Srinivasa,et al.  Constellation - An algorithm for finding robot configurations that satisfy multiple constraints , 2012, 2012 IEEE International Conference on Robotics and Automation.

[9]  Frank Chongwoo Park,et al.  Tangent space RRT: A randomized planning algorithm on constraint manifolds , 2011, 2011 IEEE International Conference on Robotics and Automation.

[10]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[11]  Kostas E. Bekris,et al.  Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning With Forward Propagation , 2018, IEEE Robotics and Automation Letters.

[12]  Thierry Siméon,et al.  Sampling-Based Motion Planning under Kinematic Loop-Closure Constraints , 2004, WAFR.

[13]  Leslie Pack Kaelbling,et al.  A hierarchical approach to manipulation with diverse actions , 2013, 2013 IEEE International Conference on Robotics and Automation.

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

[15]  Leslie Pack Kaelbling,et al.  From Skills to Symbols: Learning Symbolic Representations for Abstract High-Level Planning , 2018, J. Artif. Intell. Res..

[16]  Swarat Chaudhuri,et al.  The Task-Motion Kit: An Open Source, General-Purpose Task and Motion-Planning Framework , 2018, IEEE Robotics & Automation Magazine.

[17]  Frank Chongwoo Park,et al.  Randomized path planning on foliated configuration spaces , 2014, 2014 11th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI).

[18]  Josep M. Porta,et al.  Randomized Kinodynamic Planning for Constrained Systems , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[19]  Sachin Chitta,et al.  Motion planning with constraints using configuration space approximations , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[20]  Gaurav S. Sukhatme,et al.  Learning Manifolds for Sequential Motion Planning , 2020, ArXiv.

[21]  Nicolas Mansard,et al.  HPP: A new software for constrained motion planning , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[22]  Mark H. Overmars,et al.  A random approach to motion planning , 1992 .

[23]  Oskar von Stryk,et al.  Direct and indirect methods for trajectory optimization , 1992, Ann. Oper. Res..

[24]  Marc Toussaint,et al.  Understanding the geometry of workspace obstacles in Motion Optimization , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[25]  Bruce Randall Donald,et al.  Algorithmic and Computational Robotics: New Directions , 2001 .

[26]  Frank Chongwoo Park,et al.  Tangent bundle RRT: A randomized algorithm for constrained motion planning , 2014, Robotica.

[27]  Gaurav S. Sukhatme,et al.  Multi-step planning for robotic manipulation , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[28]  Pieter Abbeel,et al.  Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization , 2013, Robotics: Science and Systems.

[29]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[30]  Rachid Alami,et al.  A Hybrid Approach to Intricate Motion, Manipulation and Task Planning , 2009, Int. J. Robotics Res..

[31]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[32]  Léonard Jaillet,et al.  Asymptotically-optimal Path Planning on Manifolds , 2012, Robotics: Science and Systems.

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

[34]  Wolfram Burgard,et al.  Modeling and Planning Manipulation in Dynamic Environments , 2019, 2019 International Conference on Robotics and Automation (ICRA).

[35]  Nathan D. Ratliff.  Multivariate Calculus II: The geometry of smooth maps , 2015 .

[36]  E. Stein,et al.  Real Analysis: Measure Theory, Integration, and Hilbert Spaces , 2005 .

[37]  Marc Toussaint,et al.  Differentiable Physics and Stable Modes for Tool-Use and Manipulation Planning , 2018, Robotics: Science and Systems.

[38]  Alessandro Rinaldo,et al.  Estimating the reach of a manifold , 2017, Electronic Journal of Statistics.

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

[40]  Riccardo Bonalli,et al.  Trajectory Optimization on Manifolds: A Theoretically-Guaranteed Embedded Sequential Convex Programming Approach , 2019, Robotics: Science and Systems.

[41]  Mike Stilman,et al.  Global Manipulation Planning in Robot Joint Space With Task Constraints , 2010, IEEE Transactions on Robotics.

[42]  Marc Toussaint.  A Tutorial on Newton Methods for Constrained Trajectory Optimization and Relations to SLAM, Gaussian Process Smoothing, Optimal Control, and Probabilistic Inference , 2017, Geometric and Numerical Foundations of Movements.

[43]  W. Boothby.  An introduction to differentiable manifolds and Riemannian geometry , 1975 .

[44]  Lydia E. Kavraki,et al.  Exploring implicit spaces for constrained sampling-based planning , 2019, Int. J. Robotics Res..

[45]  Siddhartha S. Srinivasa,et al.  Manipulation planning on constraint manifolds , 2009, 2009 IEEE International Conference on Robotics and Automation.

[46]  Lydia E. Kavraki,et al.  Informing Multi-Modal Planning with Synergistic Discrete Leads , 2020, 2020 IEEE International Conference on Robotics and Automation (ICRA).

[47]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[48]  Leslie Pack Kaelbling,et al.  Integrated task and motion planning in belief space , 2013, Int. J. Robotics Res..

[49]  John M. Lee.  Riemannian Manifolds: An Introduction to Curvature , 1997 .

[50]  Victor Ng-Thow-Hing,et al.  Randomized multi-modal motion planning for a humanoid robot manipulation task , 2011, Int. J. Robotics Res..