Lower Bounds for Shortest Path and Related ProblemsJohn

  title={Lower Bounds for Shortest Path and Related ProblemsJohn},
  author={John F. Canny and John Reif},
We present the rst lower bounds for shortest path problems (including euclidean shortest path) in three dimensions, and for some constrained motion planning problems in two and three dimensions. Our proofs are based a technique called free path encoding and use homotopy equivalence classes of paths to encode state. We rst apply the method to the shortest path problem in three dimensions. The problem is to nd the shortest path under an L metric (e.g. a euclidean metric) between two points amid… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 20 references

On the `Piano Movers' Problem, II. General Techniques for Computing Topological Properties of Real Algebraic Manifolds," in \Planning, Geometry and Complexity of Robot Motion", ed

  • J. Schwartz, M. Sharir
  • Ablex publishing corp. New Jersey,
  • 1987

On Moving and Orienting Objects

  • B K.NaNatarajan
  • Cornell University,
  • 1986

Shortest Paths in Euclidean Space with Polyhedral Obstacles

  • J. Reif, J. Storer
  • Tech. Rep. CS-85-121,
  • 1985

Similar Papers

Loading similar papers…