Corpus ID: 9864525

Lower Bounds for Shortest Path and Related ProblemsJohn

@inproceedings{Canny1987LowerBF,
  title={Lower Bounds for Shortest Path and Related ProblemsJohn},
  author={J. Canny and J. Reif},
  year={1987}
}
  • J. Canny, J. Reif
  • Published 1987
  • 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
    15 Citations
    Nonpositive Curvature and Pareto Optimal Coordination of Robots
    • 36
    • PDF
    Computing Geodesic Distances in Tree Space
    • M. Owen
    • Mathematics, Computer Science
    • SIAM J. Discret. Math.
    • 2011
    • 40
    • PDF
    Rapid Multi-Query Path Planning For A Vertical Take-Off and Landing Unmanned Aerial Vehicle
    • 16
    Algorithms for safe robot navigation
    • 2
    • PDF
    Drone Path Planning
    • 2
    • PDF
    Distance computation in the space of phylogenetic trees
    • 7
    • PDF
    Footstep planning for humanoid robots: discrete and continuous approaches
    • 3
    • PDF
    Computing Pareto Optimal Coordinations on Roadmaps
    • 50
    • Highly Influenced
    • PDF
    CONFIGURATION SPACES, BRAIDS, AND ROBOTICS
    • 16
    • PDF

    References

    SHOWING 1-10 OF 19 REFERENCES