Approximation algorithms for shortest path motion planning

@inproceedings{Clarkson1987ApproximationAF,
  title={Approximation algorithms for shortest path motion planning},
  author={K. Clarkson},
  booktitle={STOC '87},
  year={1987}
}
  • K. Clarkson
  • Published in STOC '87 1987
  • Mathematics, Computer Science
  • This paper gives approximation algorithms of solving the following motion planning problem: Given a set of polyhedral obstacles and points <italic>s</italic> and <italic>t</italic>, find a shortest path from <italic>s</italic> to <italic>t</italic> that avoids the obstacles. The paths found by the algorithms are piecewise linear, and the length of a path is the sum of the lengths of the line segments making up the path. Approximation algorithms will be given for versions of this problem in the… CONTINUE READING
    247 Citations
    Shortest paths in the plane with polygonal obstacles
    • 98
    • PDF
    Path planning in the presence of vertical obstacles
    • 47
    Approximate and Hierarchical Path Planning
    On Fast Planning of Suboptimal Paths Amidst Polygonal Obstacles in Plane
    • N. Rao
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 1995
    • 7
    • PDF
    Approximation algorithms for curvature-constrained shortest paths
    • 69
    • PDF
    Multi-criteria Shortest Paths in 3D among Vertical Obstacles
    RECTILINEAR SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
    • PDF
    L1 shortest paths among polygonal obstacles in the plane
    • J. Mitchell
    • Mathematics, Computer Science
    • Algorithmica
    • 2005
    • 108
    Sequences of Spheres in R3
    • PDF

    References

    On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
    • A. Yao
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1982
    • 621
    • Highly Influential
    • PDF