Minimum Constraint Displacement Motion Planning

This paper formulates a new minimum constraint displacement (MCD) motion planning problem in which the goal is to minimize the amount by which constraints must be displaced in order to yield a feasible path. It presents a sampling-based planner that asymptotically approaches the globally optimal solution as more time is spent planning. Key developments are efficient data structures that allow the planner to select small subsets of obstacles and their displacements that are candidates for improving the current best solution, and local optimization methods to improve convergence rate. The resulting planner is demonstrated to successfully solve MCD problems with dozens of degrees of freedom and up to one hundred obstacles.

[1]  David Hsu,et al.  Placing a robot manipulator amid obstacles for optimized execution , 1999, Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470).

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

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

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

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

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

[7]  Gregory S. Chirikjian,et al.  Algorithmic Foundation of Robotics VIII, Selected Contributions of the Eight International Workshop on the Algorithmic Foundations of Robotics, WAFR 2008, Guanajuato, Mexico, December 7-9, 2008 , 2009, WAFR.

[8]  Emilio Frazzoli,et al.  Incremental sampling-based algorithm for minimum-violation motion planning , 2013, 52nd IEEE Conference on Decision and Control.

[9]  Kris K. Hauser,et al.  The minimum constraint removal problem with three robotics applications , 2014, Int. J. Robotics Res..

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

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

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

[13]  Gordon T. Wilfong,et al.  Motion planning in the presence of movable obstacles , 1988, SCG '88.

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

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

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