Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range

In this paper, a new self-organizing map (SOM) based adaptation procedure is proposed to address the multiple watchman route problem with the restricted visibility range in the polygonal domain W. A watchman route is represented by a ring of connected neuron weights that evolves in W, while obstacles are considered by approximation of the shortest path. The adaptation procedure considers a coverage of W by the ring in order to attract nodes toward uncovered parts of W. The proposed procedure is experimentally verified in a set of environments and several visibility ranges. Performance of the procedure is compared with the decoupled approach based on solutions of the art gallery problem and the consecutive traveling salesman problem. The experimental results show the suitability of the proposed procedure based on relatively simple supporting geometrical structures, enabling application of the SOM principles to watchman route problems in W.

[1]  Antonis A. Argyros,et al.  Fast positioning of limited-visibility guards for the inspection of 2D workspaces , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[2]  Raimund Seidel Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons , 2010, Comput. Geom..

[3]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[4]  Raimund Seidel,et al.  A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons , 1991, Comput. Geom..

[5]  Simeon C. Ntafos,et al.  Watchman Routes Under Limited Visibility , 1991, Comput. Geom..

[6]  Alessio Plebe,et al.  A Neural-Network-Based Approach to the Double Traveling Salesman Problem , 2002, Neural Computation.

[7]  Olivier Devillers,et al.  Walking in a triangulation , 2001, SCG '01.

[8]  Reinhard Klette,et al.  An Approximate Algorithm for Solving the Watchman Route Problem , 2008, RobVis.

[9]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[10]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[11]  Howie Choset,et al.  Sensor-based coverage with extended range detectors , 2006, IEEE Transactions on Robotics.

[12]  Marimuthu Palaniswami,et al.  Neural techniques for combinatorial optimization with applications , 1998, IEEE Trans. Neural Networks.

[13]  G. Roth,et al.  View planning for automated three-dimensional object reconstruction and inspection , 2003, CSUR.

[14]  Tomio Hirata,et al.  Finding shortest safari routes in simple polygons , 2003, Inf. Process. Lett..

[15]  I. Osman,et al.  A neural network algorithm for the traveling salesman problem with backhauls , 2003 .

[16]  Takao Enkawa,et al.  A self‐organizing neural network approach for multiple traveling salesman and vehicle routing problems , 1999 .

[17]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[18]  Leonidas J. Guibas,et al.  A hierarchical method for real-time distance computation among moving convex bodies , 2000, Comput. Geom..

[19]  Abder Koukam,et al.  A memetic neural network for the Euclidean traveling salesman problem , 2009, Neurocomputing.

[20]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[21]  E. M. Cochrane,et al.  The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem , 2003, Neural Networks.

[22]  Takao Asano,et al.  A new point-location algorithm and its practical efficiency: comparison with existing algorithms , 1984, TOGS.

[23]  Zhen Jin,et al.  An new self-organizing maps strategy for solving the traveling salesman problem , 2006 .

[24]  Eli Packer,et al.  Robust geometric computing and optimal visibility coverage , 2008 .

[25]  B. John Oommen,et al.  A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE , 2003, IEEE Trans. Neural Networks.

[26]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[27]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[28]  Pengpeng Wang View planning with combined view and travel cost , 2007 .

[29]  Thomas Martinetz,et al.  Topology representing networks , 1994, Neural Networks.

[30]  Mark H. Overmars,et al.  New methods for computing visibility graphs , 1988, SCG '88.

[31]  T. Shermer Recent Results in Art Galleries , 1992 .

[32]  Takao Enkawa,et al.  Competition-based neural network for the multiple travelling salesmen problem with minmax objective , 1999, Comput. Oper. Res..

[33]  Joseph S. B. Mitchell,et al.  Shortest paths among obstacles in the plane , 1993, SCG '93.

[34]  Joseph S. B. Mitchell,et al.  Two-point Euclidean shortest path queries in the plane , 1999, SODA '99.

[35]  Takao Enkawa,et al.  A self-organising model for the travelling salesman problem , 1997 .

[36]  Jean-Claude Latombe,et al.  Motion Planning: Recent Developments , 2018, Autonomous Mobile Robots.