Abstract
We consider the motion planning problem for a point constrained to move along a path with radius of curvature at least one. The point moves in a two-dimensional universe with polygonal obstacles. We show the decidability of the reachability question: “Given a source placement (position and direction pair) and a target placement, is there a curvature-constrained path from source to target avoiding obstacles?” The decision procedure has time and space complexity 2o(poly(n, m)) wheren is the number of corners andm is the number of bits required to specify the position of corners.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Baker,Transcendental Number Theory (Cambridge University Press, 1975).
E. Bender, A driving hazard revisited, SIAM Rev. 21(1) (1979) 136–138.
J. Canny, A new method for robot motion planning and real geometry,Proc. 28th IEEE Symp. on Foundations of Computer Science (1987) pp. 39–48.
E.J. Cockayne and G.W.C. Hall, Plane motion of a particle subject to curvature constraints, SIAM J. Control 43(1) (1975) 197–220.
G. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decomposition,Automata Theory and Formal Languages 2nd GI Conf., Lecture Notes in Computer Science, vol. 33 (1975) pp. 134–183.
R. Cooper,Functions of Real Variables (D. Van Nostrand, London, 1966).
L.E. Dubins, On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents, Am. J. Math. 79 (1957) 497–516.
H.I. Freedman and S.D. Riemenschneider, Determining the path of the rear wheels of a bus, SIAM Rev. 25(4) (1983) 561–567.
J.P. Laumond, Feasible trajectories for mobile robots with kinematic and environment constraints,Proceedings of Intelligent Autonomous Systems (1986) pp. 346–354.
C. Ó'Dúnlaing, Motion planning with inertial constraints, Algorithmica 2(4) (1987) 431–475.
J. Reeds and L. Shepp, Optimal paths for a car that goes both forwards and backwards, unpublished manuscript.
J. Reif, private communication.
J. Reif and M. Sharir, Motion planning in the presence of moving obstacles,Proc. 26th Annual Symp. on Foundations of Computer Science (1985) pp. 144–154.
J.T. Schwartz and M. Sharir, On the piano movers' problem. II. General techniques for computing topological properties of real algebraic manifolds, Adv. Appl. Math. 4 (1983) 298–351.
J.E. Shigley,Kinematic Analysis of Mechanics (McGraw-Hill, New York, 1959).
L. Weisner,Introduction to the Theory of Equations, 6th ed. (MacMillan, 1959).
C.K. Yap, Algorithmic motion planning, in:Advances in Robotics, vol. 1: Algorithmic and Geometric Aspects, J.T. Schwartz and C.K. Yap (eds.) (Lawrence Erlbaum Ass., Hillsdale, NJ, 1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fortune, S., Wilfong, G. Planning constrained motion. Ann Math Artif Intell 3, 21–82 (1991). https://doi.org/10.1007/BF01530887
Issue Date:
DOI: https://doi.org/10.1007/BF01530887