Abstract
Robot path planning is a typical example of a problem that requires searching a “continuous” space, the robot's configuration space, for a solution, a collision-free path. The global approach to path planning first captures the connectivity of the robot's free space into a concise connectivity path, and next searches this graph. The local approach directly embarks on a search procedure, and performs geometric computation according to the needs of the search. Global methods may waste a large amount of computation before they have any chance to find a path. On the other hand, local methods, which lack the global vision provided by the connectivity graph, have very poor worst-case complexity. Is it possible to instill some local opportunism in a global approach, or a limited amount of precomputed global information in a local approach? More generally: How can geometric computation and search help each other to produce a path quickly? These questions probably do not have definite domain-independent answers. However, raising them may help us engineer path planners that better meet specific application needs. This paper considers these questions through a series of informal case studies, each corresponding to a particular way to engineer the interaction between geometry and search in a path planner.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
J. Barraquand, B. Langlois and J.C. Latombe, Numerical potential field techniques for robot path planning,Proc. 5th Int. Conf. on Advanced Robotics (ICAR), Pisa, Italy (1991) pp. 1012–1017.
J. Barraquand and J.C. Latombe, Robot motion planning: A distributed representation approach, Int. J. Robotics Res. 10(1991)628–649.
R.A. Brooks and T. Lozano-Pérez, A subdivision algorithm in configuration space for findpath with rotation, IEEE Trans. Systems, Man, and Cybernetics 15(1985)224–233.
S.J. Buckley, Fast motion planning for multiple moving robots,Proc. IEEE Int. Conf. on Robotics and Automation, Scottsdale, AZ (1989) pp. 322–326.
J.F. Canny,The Complexity of Robot Motion Planning (MIT Press, Cambridge, MA, 1988).
J.F. Canny and M.C. Lin, An opportunistics global path planner,Proc. IEEE Int. Conf. on Robotics and Automation, Cincinnati, OH (1990) pp. 1554–1559.
M.A. Erdmann and T. Lozano-Pérez, On multiple moving objects, AI Memo No. 883, AI Laboratory, MIT, Cambridge, MA (1986).
B. Faverjon and P. Tournassoud, A local based approach for path planning of manipulators with a high number of degrees of freedom,Proc. IEEE Int. Conf. on Robotics and Automation, Raleigh, NC (1987) pp. 1152–1159.
O. Khatib, Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robotics Res. 5(1986)90–98.
D. Koditshek, Exact robot navigation by means of potential functions: Some topological considerations,Proc. IEEE Int. Conf. on Robotics and Automation, Raleigh, NC (1987) pp. 1–6.
J.C. Latombe,Robot Motion Planning (Kluwer, Boston, MA, 1991).
J. Lengyel, M. Reichert, B.R. Donald and D.P. Greenberg, Real-time robot motion planning using rasterizing computer graphics hardware,Proc. SIGGRAPH'90, Dallas, TX (1990) pp. 327–335.
T. Lozano-Pérez, Spatial planning: A configuration space approach, IEEE Trans. Computers 32(1982) 108–120.
C. Ó'Dúnlaing, M. Sharir and C.K. Yap, Retraction: A new approach to motion planning,Proc. 15th ACM Symp. on the Theory of Computing, Boston, MA (1983) pp. 207–220.
M. Pasquier, Planification de trajectoires pour un robot manipulateur, Thèse de Doctorat de l'Institut National Polytechnique, Grenoble, France (1989), in French.
J.T. Schwartz and M. Sharir, On the piano movers' problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers, Commun. Pure Appl. Math. 36(1983)345–398.
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.
D.J. Zhu and J.C. Latombe, New heuristic algorithms for efficient hierarchical path planning, IEEE Trans. Robotics and Automation 7(1991)9–20.
D.J. Zhu and J.C. Latombe, Mechanization of spatial reasoning for automatic pipe layout design, (AI EDAM) Artificial Intelligence for Engineering Design, Analysis and Manufacturing 5(1991) 1–20.
D.J. Zhu, Exploring the interaction of geometry and search in path planning, Ph.D. Dissertation, Department of Computer Science, Stanford University, Stanford, CA (1992).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Latombe, J.C. Geometry and search in motion planning. Ann Math Artif Intell 8, 215–227 (1993). https://doi.org/10.1007/BF01530790
Issue Date:
DOI: https://doi.org/10.1007/BF01530790