The minimum constraint removal problem with three robotics applications

This paper formulates a new Minimum Constraint Removal (MCR) motion planning problem in which the objective is to remove the fewest geometric constraints necessary to connect a start and goal state with a free path. It describes a probabilistic roadmap motion planner for MCR in continuous configuration spaces that operates by constructing increasingly refined roadmaps, and efficiently solves discrete MCR problems on these networks. A number of new theoretical results are given for discrete MCR, including a proof that it is NP-hard by reduction from SET-COVER. Two search algorithms are described that perform well in practice. The motion planner is proven to produce the optimal MCR with probability approaching 1 as more time is spent, and its convergence rate is improved with various efficient sampling strategies. It is demonstrated on three example applications: generating human-interpretable excuses for failure, motion planning under uncertainty, and rearranging movable obstacles.

[1]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[3]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[4]  Patrick Prosser,et al.  An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[5]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[7]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[8]  Leonidas J. Guibas,et al.  Disconnection proofs for motion planning , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[9]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[10]  M. Chial,et al.  in simple , 2003 .

[11]  Timothy Bretl,et al.  Multi-Step Motion Planning for Free-Climbing Robots , 2004, WAFR.

[12]  James J. Kuffner,et al.  Navigation among movable obstacles: real-time reasoning in complex environments , 2004, 4th IEEE/RAS International Conference on Humanoid Robots, 2004..

[13]  S. LaValle,et al.  Sampling-Based Motion Planning With Differential Constraints , 2005 .

[14]  Dinesh Manocha,et al.  A Simple Path Non-existence Algorithm Using C-Obstacle Query , 2006, WAFR.

[15]  Mike Stilman,et al.  Navigation among movable obstacles , 2007 .

[16]  Kamal K. Gupta,et al.  Collision-probability constrained PRM for a manipulator with base pose uncertainty , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Bernhard Nebel,et al.  Coming up With Good Excuses: What to do When no Plan Can be Found , 2010, Cognitive Robotics.

[18]  Gregory D. Hager,et al.  Sampling-Based Motion and Symbolic Action Planning with geometric and differential constraints , 2010, 2010 IEEE International Conference on Robotics and Automation.

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

[20]  Siddhartha S. Srinivasa,et al.  A Framework for Push-Grasping in Clutter , 2011, Robotics: Science and Systems.

[21]  E. Plaku.  Planning Robot Motions to Satisfy Linear Temporal Logic, Geometric, and Differential Constraints , 2012 .

[22]  Timothy Bretl,et al.  Proving path non-existence using sampling and alpha shapes , 2012, 2012 IEEE International Conference on Robotics and Automation.

[23]  Steven M. LaValle,et al.  A Simple, but NP-Hard, Motion Planning Problem , 2013, AAAI.