Controllability, recognizability, and complexity issues in robot motion planning

Path planning has been widely studied by computer scientists. However, it is a very simplified version of the motion planning problems occurring in robotics. This paper examines extensions yielding two important issues: controllability and recognizability. The controllability issue arises when the number of controls is smaller than the number of independent parameters defining the robot's configuration: Can the motions span the configuration space? The recognizability issue occurs when there are errors in control and sensing: Can the robot recognize goal achievement? Both issues have interesting impact on the computational complexity of motion planning. This paper will also discuss a new path planning scheme based on random sampling of configuration space, to deal with many-degree-of-freedom robots. The blend of controllability, recognizability, and complexity issues discussed in this paper is unique to robotics and its study is key to the development of autonomous robots.

[1]  J.-P. Laumond.  Nonholonomic motion planning via optimal control , 1995 .

[2]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.

[3]  John E. Hopcroft,et al.  Reducing Multiple Object Motion Planning to Graph Searching , 1984, SIAM J. Comput..

[4]  Teofilo F. Gonzalez,et al.  Inproved Bounds for Rectangular and Guillotine Partitions , 1989, J. Symb. Comput..

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

[6]  Anthony Lazanas.  Reasoning About Uncertainty in Robot Motion Planning , 1995 .

[7]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[8]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[9]  P. Souéres,et al.  The Shortest path synthesis for non-holonomic robots moving forwards , 1994 .

[10]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[11]  Mariette Yvinec,et al.  Convex Tours on Bounded Curvature , 1994, ESA.

[12]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

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

[14]  Jean-Claude Latombe,et al.  Robot Motion Planning with Uncertainty in Control and Sensing , 1991, Artif. Intell..

[15]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[16]  Michael Erdmann,et al.  Randomization in Robot Tasks , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[17]  Pankaj K. Agarwal,et al.  Motion planning for a steering-constrained robot through moderate obstacles , 1995, STOC '95.

[18]  John F. Canny,et al.  On computability of fine motion plans , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[19]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[20]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[21]  Amy J. Briggs.  An efficient algorithm for one-step planar complaint motion planning with uncertainty , 1989, SCG '89.

[22]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[23]  Bruce Randall Donald,et al.  A Geometric Approach to Error Detection and Recovery for Robot Motion Planning with Uncertainty , 1987, Artif. Intell..

[24]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1994, J. Intell. Robotic Syst..

[25]  Jean-Claude Latombe,et al.  Motion Planning with Uncertainty: A Landmark Approach , 1995, Artif. Intell..

[26]  John F. Canny,et al.  Using skeletons for nonholonomic path planning among obstacles , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[27]  Gordon T. Wilfong,et al.  Planning constrained motion , 1988, STOC '88.

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

[29]  Matthew T. Mason,et al.  Automatic planning of fine motions: Correctness and completeness , 1984, ICRA.

[30]  A. Krener,et al.  Nonlinear controllability and observability , 1977 .

[31]  El-Ghazali Talbi,et al.  The "Ariadne's clew" algorithm: global planning with local methods , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[32]  Michael A. Erdmann,et al.  Using Backprojections for Fine Motion Planning with Uncertainty , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[33]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[34]  Jean-Claude Latombe,et al.  Geometric Reasoning About Mechanical Assembly , 1994, Artif. Intell..

[35]  Lydia E. Kavraki,et al.  Treatment planning for a radiosurgical system with general kinematics , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[36]  Deborah A. Joseph,et al.  On the complexity of reachability and motion planning questions (extended abstract) , 1985, SCG '85.

[37]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.

[38]  Jean-Paul Laumond,et al.  Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints , 1986, IAS.

[39]  Richard M. Murray,et al.  A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..

[40]  Micha Sharir,et al.  Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[41]  Henning Tolle,et al.  Motion planning with many degrees of freedom-random reflections at C-space obstacles , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[42]  Jean-Claude Latombe.  A Fast Path Planner for a Car-Like Indoor Mobile Robot , 1991, AAAI.

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

[44]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[45]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[46]  Kevin M. Lynch,et al.  Stable Pushing: Mechanics, Controllability, and Planning , 1995, Int. J. Robotics Res..

[47]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[48]  Rajeev Motwani,et al.  Dynamic Maintenance of Kinematic Structures , 1995 .