New lower bound techniques for robot motion planning problems

We present new techniques for establishing lower bounds in robot motion planning problems. Our scheme is based on path encoding and uses homotopy equivalence classes of paths to encode state. We first apply the method to the shortest path problem in 3 dimensions. The problem is to find the shortest path under an Lp metric (e.g. a euclidean metric) between two points amid polyhedral obstacles. Although this problem has been extensively studied, there were no previously known lower bounds. We show that there may be exponentially many shortest path classes in single-source multiple-destination problems, and that the single-source single-destination problem is NP-hard. We use a similar proof technique to show that two dimensional dynamic motion planning with bounded velocity is NP-hard. Finally we extend the technique to compliant motion planning with uncertainty in control. Specifically, we consider a point in 3 dimensions which is commanded to move in a straight line, but whose actual motion may differ from the commanded motion, possibly involving sliding against obstacles. Given that the point initially lies in some start region, the problem of finding a sequence of commanded velocities which is guaranteed to move the point to the goal is shown to be non-deterministic exponential time hard, making it the first provably intractable problem in robotics.

[1]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[2]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[3]  井上 博允,et al.  Force Feedback in Precise Assembly Tasks , 1975 .

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

[5]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[6]  Matthew T. Mason,et al.  Compliance and Force Control for Computer Controlled Manipulators , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

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

[9]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

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

[11]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

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

[13]  Michael A. Erdmann,et al.  On Motion Planning with Uncertainty , 1984 .

[14]  D. Mount.  On Finding Shortest Paths on Convex Polyhedra. , 1985 .

[15]  C. Bajaj.  The Algebraic Complexity of Shortest Paths in Polyhedral Spaces , 1985 .

[16]  J. Reif,et al.  Shortest Paths in Euclidean Space with Polyhedral Obstacles. , 1985 .

[17]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[18]  Chee-Keng Yap,et al.  Algebraic cell decomposition in NC , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[19]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[20]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[21]  B. Natarajan.  On Moving and Orienting Objects , 1986 .

[22]  Joseph S. B. Mitchell,et al.  The weighted region problem , 1987, SCG '87.

[23]  Micha Sharir.  On Shortest Paths Amidst Convex Polyhedra , 1987, SIAM J. Comput..

[24]  John F. Canny,et al.  A new algebraic method for robot motion planning and real geometry , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[25]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .