Affiliation:
1. School of Computer Science Tel Aviv University Israel
2. Department of Computer Science University of North Carolinaat Chapel Hill USA,
3. School of Computer Science Tel Aviv University Israel,
Abstract
The motion-planning problem, involving the computation of a colli sion-free path for a moving entity amidst obstacles, is a central prob lem in fields such robotics and game design. In this paper we study the problem of planning high-quality paths. A high-quality path should have some desirable properties: it should be short, avoiding long detours, and at the same time it should stay at a safe distance from the obstacles, namely it should have clearance. We suggest a quality measure for paths, which balances between the above criteria of minimizing the path length while maximizing its clearance. We analyze the properties of optimal paths according to our measure, and devise an approximation algorithm to compute near-optimal paths amidst polygonal obstacles in the plane. We also apply our quality measure to corridors. Instead of planning a one-dimensional motion path for a moving entity, it is often more convenient to let the entity move in a corridor, where the exact motion path is determined by a local planner. We show that planning an optimal corridor is equivalent to planning an optimal path with bounded clearance.
Subject
Applied Mathematics,Artificial Intelligence,Electrical and Electronic Engineering,Mechanical Engineering,Modelling and Simulation,Software
Reference25 articles.
1. Intersection Queries in Curved Objects
2. Gray, A. (1997). Logarithmic spirals. Modern Differential Geometry of Curves and Surfaces with Mathematica, 2nd edn. CRC Press, Boca Raton, FL, pp. 40-42.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献