Abstract
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let X denote a sequence of n points. Let s be the length of the shortest curvature-constrained path for B that visits the points of X in the given order. We show that if the points of X are given on-line and the robot has to respond to each point immediately, there is no strategy that guarantees apath whose length is at most f(n)s, for any finite function f(n). On the other hand, if all points are given at once, a path with length at most 5.03s can be computed in linear time. In the semi-online case, where the robot not only knows the next input point but is able to “see” the future input points included in the disk with radius R around the robot, a path of length (5.03 + O(1/R))s can be computed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. K. Agarwal, T. Biedl, S. Lazard, S. Robbins, S. Suri, and S. Whitesides. Curvature-constrained shortest paths in a convex polygon. In Proc. 14th SCG, pages 392–401, 1998.
P. K. Agarwal, P. Raghavan, and H. Tamaki. Motion planning of a steering-constrained robot through moderate obstacles. In Proc. 27th STOC, pages 343–352, 1995.
H.-K. Ahn, O. Cheong, J. Matoušek, and A. Vigneron. Reachability by paths of bounded curvature in convex polygons. Proc. 16th SCG (to appear), 2000.
J. D. Boissonnat, A. Cerezo, and J. Leblond. Shortest paths of bounded curvature in the plane. Interat. J. Intell. Syst., 10:1–16, 1994.
J. D. Boissonnat and S. Lazard. A polynomial-time algorithm for computing a shortest path of bounded curvature admist moderate obstacles. In Proc. 12th SCG, pages 242–251, 1996.
B. Donald, P. Xavier, J. Canny, and J. Reif. Kinodynamic motion planning. JACM, 40(5): 1048–1066, 1993.
L. E. Dubins. On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents. Amer. J. Math., 79:497–516, 1957.
S. Fortune and G. Wilfong. Planning constrained motion. Ann. Math. Artif. Intell., 3:21–82, 1991.
P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In Nonholonomic Motion Planning (Z. Li and J. Canny, eds), pages 271–342, 1992.
G. Pestov and V. Ionin. On the largest possible circle imbedded in a given closed curve. Dok. Akad. Nauk SSSR, 127:1170–1172, 1959. (In Russian).
J. A. Reeds and L. A. Shepp. Optimal paths for a car that goes forwards and backwards. Pacific J. Math., 145(2), 1990.
J. Reif and H. Wang. The complextiy of the two-dimensional curvature-constrained shortest-path problem. In Proc. of 3rd Workshop on the Algorithmic Foundations of Robotics, 1998.
H. Wang and P. K. Agarwal. Approximation algorithm for curvature constrained shortest paths. In Proc. 7th SODA, pages 409–418, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, J.H., Cheong, O., Kwon, W.C., Shin, S.Y., Chwa, K.Y. (2000). Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. In: Paterson, M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45253-2_29
Download citation
DOI: https://doi.org/10.1007/3-540-45253-2_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41004-1
Online ISBN: 978-3-540-45253-9
eBook Packages: Springer Book Archive