Sampling-Based Methods for Motion Planning with Constraints

Robots with many degrees of freedom (e.g., humanoid robots and mobile manipulators) have increasingly been employed to accomplish realistic tasks in domains such as disaster relief, spacecraft logistics, and home caretaking. Finding feasible motions for these robots autonomously is essential for their operation. Sampling-based motion planning algorithms are effective for these high-dimensional systems; however, incorporating task constraints (e.g., keeping a cup level or writing on a board) into the planning process introduces significant challenges. This survey describes the families of methods for sampling-based planning with constraints and places them on a spectrum delineated by their complexity. Constrained sampling-based methods are based on two core primitive operations: (a) sampling constraint-satisfying configurations and (b) generating constraint-satisfying continuous motion. Although this article presents the basics of sampling-based planning for contextual background, it focuses on the represe...

[1]  Kris K. Hauser,et al.  Fast interpolation and time-optimization with contact , 2014, Int. J. Robotics Res..

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

[3]  Josep M. Porta,et al.  Planning Singularity-Free Paths on Closed-Chain Manipulators , 2013, IEEE Transactions on Robotics.

[4]  Henry van den Bedem,et al.  Nullspace Sampling with Holonomic Constraints Reveals Molecular Mechanisms of Protein Gαs , 2015, PLoS Comput. Biol..

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

[6]  W. Rheinboldt.  MANPAK: A set of algorithms for computations on implicitly defined manifolds , 1996 .

[7]  Keenan Crane,et al.  Geodesics in heat: A new approach to computing distance based on heat flow , 2012, TOGS.

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

[9]  Lydia E. Kavraki,et al.  A Sampling-Based Tree Planner for Systems With Complex Dynamics , 2012, IEEE Transactions on Robotics.

[10]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Masayuki Inaba,et al.  Dynamically-Stable Motion Planning for Humanoid Robots , 2002, Auton. Robots.

[12]  Lexing Ying,et al.  Fast geodesics computation with the phase flow method , 2006, J. Comput. Phys..

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

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

[15]  Steven M. LaValle,et al.  On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[16]  Kris K. Hauser,et al.  Unbiased, scalable sampling of protein loop conformations from probabilistic priors , 2013, BMC Structural Biology.

[17]  Timothy Bretl,et al.  Motion Planning for Legged Robots on Varied Terrain , 2008, Int. J. Robotics Res..

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

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

[20]  Michael E. Henderson,et al.  Multiple Parameter Continuation: Computing Implicitly Defined k-Manifolds , 2002, Int. J. Bifurc. Chaos.

[21]  Li Han,et al.  Convexly Stratified Deformation Spaces and Efficient Path Planning for Planar Closed Chains with Revolute Joints , 2008, Int. J. Robotics Res..

[22]  H. Scheraga,et al.  Exact analytical loop closure in proteins using polynomial equations , 1999 .

[23]  Nancy M. Amato,et al.  RESAMPL: A Region-Sensitive Adaptive Motion Planner , 2008, WAFR.

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

[25]  Lydia E. Kavraki,et al.  Measure theoretic analysis of probabilistic path planning , 2004, IEEE Transactions on Robotics and Automation.

[26]  Rajeev Motwani,et al.  Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..

[27]  Kostas E. Bekris,et al.  Sparse roadmap spanners for asymptotically near-optimal motion planning , 2014, Int. J. Robotics Res..

[28]  Kris Hauser,et al.  Asymptotically Optimal Planning by Feasible Kinodynamic Planning in a State–Cost Space , 2015, IEEE Transactions on Robotics.

[29]  Piotr Indyk,et al.  Nearest Neighbors in High-Dimensional Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[30]  Frank Chongwoo Park,et al.  Randomized path planning for tasks requiring the release and regrasp of objects , 2016, Adv. Robotics.

[31]  Kostas E. Bekris,et al.  Asymptotically optimal sampling-based kinodynamic planning , 2014, Int. J. Robotics Res..

[32]  Dan Halperin,et al.  On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages , 2012, IEEE Transactions on Automation Science and Engineering.

[33]  Milan Simic,et al.  Sampling-Based Robot Motion Planning: A Review , 2014, IEEE Access.

[34]  Oussama Khatib,et al.  Synthesis of Whole-Body Behaviors through Hierarchical Control of Behavioral Primitives , 2005, Int. J. Humanoid Robotics.