Approximation algorithms for shortest path motion planning

This paper gives approximation algorithms of solving the following motion planning problem: Given a set of polyhedral obstacles and points s and t, find a shortest path from s to t 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 plane and in three-dimensional space. The algorithms return an &egr;-short path, that is, a path with length within (1 + &egr;) of shortest. Let n be the total number of faces of the polyhedral obstacles, and &egr; a given value satisfying &Ogr; < &egr; ≤ &pgr;. The algorithm for the planar case requires &Ogr;(n log n)/&egr; time to build a data structure of size &Ogr;(n/&egr;). Given points s and t, and &egr;-short path from s to t can be found with the use of the data structure in time &Ogr;(n/&egr; + n log n). The data structure is associated with a new variety of Voronoi diagram. Given obstacles S ⊂ &Egr;3 and points s, t &egr; E3, an &egr;-short path between s and t can be found in &Ogr;(n2&lgr;(n) log(n/&egr;)/&egr;4 + n2 lognp log(n logp)) time, where p is the ratio of the length of the longest obstacle edge to the distance between s to t. The function &lgr;(n) = &agr;(n)&Ogr;(&agr;(n)&Ogr;(1)), where the &agr;(n) is a form of inverse of Ackermann's function. For log(1/&egr;) and log p that are &Ogr;(log n), this bound is &Ogr;(log n2(n)&lgr;(n)/&egr;4).