An Art Gallery-Based Approach: Roadmap Construction and Path Planning in Global Environments

In this paper, we present a novel near-optimal art gallery-based algorithm for placing a small (but sufficient) number of robot configurations to plan its path in a 2D environment cluttered with obstacles. The solution of the problem is inspired from the well-known art gallery problem (AGP) which asks to position the minimum number of guards required to cover a gallery that is represented as a simple polygon with n vertices and h holes. The proposed algorithm efficiently computes the placement of guards in simple polygons with holes, which runs in O(n log n) time and requires a linear storage complexity. The proposed algorithm can be useful in a variety of applications such as 3D model construction of a workspace, navigation and inspection tasks, medical surgery, and virtual reality exploration systems. It can also be used to solve the robot motion planning problem for an autonomous mobile robot in a global environment. A 2D workspace for an autonomous robot can be modeled as a gallery and the obstacles are presented as holes. The proposed placement guarantees to compute the near-optimal distribution of guards that fully cover the entire free space. Such guards can then be used as milestones along the path of the robot. The proposed algorithm is not only offering a better performance in terms of computational cost but also ease in implementation. Simulation results demonstrate the efficiency, robustness, and potential of the proposed algorithm compared to other visibility-based techniques.

[1]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[2]  Ashraf Elnagar,et al.  An art gallery-based approach to autonomous robot motion planning in global environments , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

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

[5]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

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

[7]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[8]  Aldo Laurentini,et al.  Guarding the walls of an art gallery , 1999, The Visual Computer.

[9]  Ashraf Elnagar,et al.  Performance evaluation of robot motion planning algorithms: VIS-PRM vs. AGRM , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[10]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[11]  Franco P. Preparata,et al.  Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..

[12]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[13]  E. A. Maxwell,et al.  Mathematical Gems II , 1976, The Mathematical Gazette.

[14]  Diane L. Souvaine,et al.  An efficient algorithm for guard placement in polygons with holes , 1995, Discret. Comput. Geom..

[15]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[16]  Frank Hoffmann,et al.  The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Jan van Leeuwen,et al.  Worst-case Analysis of Set Union Algorithms , 1984, JACM.