SCG '86 Proceedings of the second annual symposium on Computational geometry
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Watchman routes under limited visibility
Computational Geometry: Theory and Applications
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Topology representing networks
Neural Networks
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Competition-based neural network for the multiple travelling salesmen problem with minmax objective
Computers and Operations Research - Special issue on the traveling salesman problem
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
A new point-location algorithm and its practical efficiency: comparison with existing algorithms
ACM Transactions on Graphics (TOG)
A neural network algorithm for the traveling salesman problem with backhauls
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
View planning for automated three-dimensional object reconstruction and inspection
ACM Computing Surveys (CSUR)
A neural-network-based approach to the double traveling salesman problem
Neural Computation
Finding shortest safari routes in simple polygons
Information Processing Letters
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
Robust geometric computing and optimal visibility coverage
Robust geometric computing and optimal visibility coverage
An approximate algorithm for solving the watchman route problem
RobVis'08 Proceedings of the 2nd international conference on Robot vision
Sensor-based coverage with extended range detectors
IEEE Transactions on Robotics
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Neural techniques for combinatorial optimization with applications
IEEE Transactions on Neural Networks
A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE
IEEE Transactions on Neural Networks
Information Sciences: an International Journal
Self-organizing map for the multi-goal path planning with polygonal goals
ICANN'11 Proceedings of the 21th international conference on Artificial neural networks - Volume Part I
Inspection planning in the polygonal domain by Self-Organizing Map
Applied Soft Computing
Multi-robot repeated area coverage
Autonomous Robots
Visiting convex regions in a polygonal map
Robotics and Autonomous Systems
Hi-index | 0.00 |
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.