Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph

An algorithm for finding the shortest path of a disc among a set of polygonal obstacles is presented. Let N/sub t/ denote the total number of obstacle vertices and N/sub c/ the number of convex vertices. Our algorithm uses a radius-independent data structure called extended tangent graph (ETG) which registers collision-free tangents of the obstacles according to different discs and takes O(N/sub c//sup 2/) space. The ETG depends only on original obstacles, and it is constructed in advance without using any information about the disc in O((N/sub c/+k)N/sub t/) computation time, where k is the number of outer common tangents of the obstacles. It takes O(N/sub t/logN/sub t/) time to partially update the ETG to reflect the start and goal of a given disc. The shortest path is planned by a graph-search algorithm. >

[1]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[2]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[3]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[4]  Steven L. Tanimoto,et al.  Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..

[6]  Micha Sharir,et al.  Retraction: A new approach to motion-planning , 1983, STOC.

[7]  L. Paul Chew,et al.  Planning the shortest path for a disc in O(n2log n) time , 1985, SCG '85.

[8]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[9]  Hans Rohnert,et al.  Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..

[10]  Jean-Paul Laumond,et al.  Obstacle Growing in a Nonpolygonal World , 1987, Inf. Process. Lett..

[11]  Hiroshi Noborio,et al.  A fast path-planning algorithm by synchronizing modification and search of its path graph (mobile robots) , 1988, Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications.

[12]  Leonidas J. Guibas,et al.  An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body , 1988, J. Algorithms.

[13]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

[14]  Yunhui Liu,et al.  Proposal of tangent graph and extended tangent graph for path planning of mobile robots , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[15]  S. Arimoto,et al.  Path Planning Using a Tangent Graph for Mobile Robots Among Polygonal and Curved Obstacles , 1992 .

[16]  James A. Storer,et al.  Shortest paths in the plane with polygonal obstacles , 1994, JACM.

[17]  Joseph S. B. Mitchell.  Shortest paths among obstacles in the plane , 1996, Int. J. Comput. Geom. Appl..