A solution to the Path Planning problem using angle preprocessing

The Path Planning problem is a common topic for Robotics and Computational Geometry. Many important results have been found to this classic problem, some of them based on plane or space tessellation. The new approach we propose in this paper computes a partition of the plane called the Polar Diagram, using angle properties as criterion of construction. Compared to some other plane partitions as Voronoi Diagrams, this tessellation can be computed much more efficiently for different geometric objects. The polar diagram used as preprocessing can be applied to many geometric problems where the solution can be given by angle processing, such as Visibility or Path Planning problems.

[1]  Bahram Sadeghi Bigham,et al.  Dynamic polar diagram , 2008, Inf. Process. Lett..

[2]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[3]  Cristina Urdiales,et al.  Efficient integration of metric and topological maps for directed exploration of unknown environments , 2002, Robotics Auton. Syst..

[4]  Juan B. Mena.  Automatic vectorization of segmented road networks by geometrical and topological analysis of high resolution binary images , 2006, Knowl. Based Syst..

[5]  Karl Tombre,et al.  Robust and accurate vectorization of line drawings , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[7]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[8]  Jae-Bok Song,et al.  Real-time building of a thinning-based topological map with metric features , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[9]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[10]  Francisco R. Feito-Higueruela,et al.  Collision detection using polar diagrams , 2005, Comput. Graph..

[11]  Li-Tien Cheng,et al.  Visibility of Point Clouds and Mapping of Unknown Environments , 2006, ACIVS.

[12]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[13]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[14]  Klara Kedem,et al.  A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion , 1993, Comput. Geom..

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

[16]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[17]  Alex M. Andrew,et al.  DIGITAL DESIGN LAB MANUAL, by Jerry D. Daniels, Wiley, N.Y., 1996, vi+207 pp, ISBN 0-471-14686-2 (Softcover, £9.99). , 1998, Robotica.

[18]  Oded Maron,et al.  Visible Decomposition: Real-Time Path Planning in Large Planar Environments , 1996 .

[19]  Micha Sharir,et al.  An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles , 1985, SCG '85.

[20]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[21]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[22]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[23]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[24]  Micha Sharir,et al.  Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces , 1997, Discret. Comput. Geom..

[25]  Clara I. Grima,et al.  A new 2D tessellation for angle problems: The polar diagram , 2006, Comput. Geom..

[26]  Benjamin Watson,et al.  Vectorization of gridded urban land use data , 2007, SIGGRAPH '07.

[27]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[28]  Ray A. Jarvis,et al.  Topologically-directed navigation , 2008, Robotica.

[29]  Victor Klee.  Is Every Polygonal Region Illuminable from Some Point , 1969 .

[30]  Hans Jørgen Andersen,et al.  Uniqueness Filtering for Local Feature Descriptors in Urban Building Recognition , 2008, ICISP.

[31]  Lakmal D. Seneviratne,et al.  Time-optimal smooth-path motion planning for a mobile robot with kinematic constraints , 1997, Robotica.

[32]  Pekka Isto,et al.  A two-level search algorithm for motion planning , 1997, Proceedings of International Conference on Robotics and Automation.

[33]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[34]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[35]  Carme Torras,et al.  3D collision detection: a survey , 2001, Comput. Graph..

[36]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..