Approximate solution of the multiple watchman routes problem with restricted visibility range

IEEE Transactions on Neural Networks

Volumn 21, Issue 10, 2010, Pages 1668-1679

  Faigl, Jan ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Self organizing maps; watchman route problem

Indexed keywords

APPROXIMATE SOLUTION; ART GALLERY PROBLEM; GEOMETRICAL STRUCTURE; POLYGONAL DOMAIN; SHORTEST PATH; WATCHMAN ROUTE PROBLEM;

CONFORMAL MAPPING; SELF ORGANIZING MAPS; VISIBILITY;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; AUDIOVISUAL EQUIPMENT; COMPUTER SIMULATION;

ALGORITHMS; COMPUTER SIMULATION; MAPS AS TOPIC; NEURAL NETWORKS (COMPUTER);

EID: 77957799158     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2010.2070518     Document Type: Article

References (36)

1. H. Ghaziri and I. H. Osman, "A neural network algorithm for the traveling salesman problem with backhauls", Comput. Ind. Eng., vol. 44, no. 2, pp. 267-281, Feb. 2003.
2. A. Modares, S. Somhom, and T. Enkawa, "A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems", Int. Trans. Oper. Res., vol. 6, no. 6, pp. 591-606, Nov. 1999.
3. K. Smith, M. Palaniswami, and M. Krishnamoorthy, "Neural techniques for combinatorial optimization with applications", IEEE Trans. Neural Netw., vol. 9, no. 6, pp. 1301-1318, Nov. 1998. (Pubitemid 128742410)
4. S. Somhom, A. Modares, and T. Enkawa, "Competition-based neural network for the multiple travelling salesmen problem with minmax objective", Comput. Oper. Res., vol. 26, no. 4, pp. 395-407, Apr. 1999.
5. Y. Bai, W. Zhang, and Z. Jin, "An new self-organizing maps strategy for solving the traveling salesman problem", Chaos, Solitons & Fractals, vol. 28, no. 4, pp. 1082-1089, May 2006.
6. E. M. Cochrane and J. E. Beasley, "The co-adaptive neural network approach to the Euclidean travelling salesman problem", Neural Netw., vol. 16, no. 10, pp. 1499-1525, Dec. 2003.
7. J.-C. Créput and A. Koukam, "A memetic neural network for the Euclidean traveling salesman problem", Neurocomputing, vol. 72, nos. 4-6, pp. 1250-1264, Jan. 2009.
8. S. Somhom, A. Modares, and T. Enkawa, "A self-organising model for the travelling salesman problem", J. Oper. Res. Soc., vol. 48, no. 9, pp. 919-928, Sep. 1997.
9. A. Plebe and A. M. Anile, "A neural-network-based approach to the double traveling salesman problem", Neural Comput., vol. 14, no. 2, pp. 437-471, Feb. 2002.
10. W.-P. Chin and S. Ntafos, "Optimum watchman routes", in Proc. 2nd Annu. ACM Symp. Comput. Geometry, Yorktown Heights, NY, 1986, pp. 24-33.
11. T. C. Shermer, "Recent results in art galleries", Proc. IEEE, vol. 80, no. 9, pp. 1384-1399, Sep. 1992.
12. N. Aras, I. K. Altinel, and J. Oommen, "A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES-DECOMPOSE", IEEE Trans. Neural Netw., vol. 14, no. 4, pp. 869-890, Jul. 2003.
13. J. E. Goodman and J. O'Rourke, Handbook of Discrete and Computational Geometry. Boca Raton, FL: CRC Press, 2004.
14. F. Li and R. Klette, "An approximate algorithm for solving the watchman route problem", in Proc. 2nd Int. Conf. Robot Vis., 2008, pp. 189-206.
15. E. Packer, "Robust geometric computing and optimal visibility coverage", Ph. D. dissertation, Dept. Comput. Sci., Stony Brook Univ., Stony Brook, NY, 2008.
16. W. R. Scott, G. Roth, and J.-F. Rivest, "View planning for automated 3-D object reconstruction and inspection", ACM Comput. Surv., vol. 35, no. 1, pp. 64-96, Mar. 2003.
17. P. Wang, "View planning with combined view and travel cost", Ph. D. dissertation, School Eng. Sci., Simon Fraser Univ., Vancouver, BC, Canada, 2007.
18. X. Tan and T. Hirata, "Finding shortest safari routes in simple polygons", Inform. Process. Lett., vol. 87, no. 4, pp. 179-186, Aug. 2003.
19. S. C. Ntafos, "Watchman routes under limited visibility", Comput. Geomentry: Theory Appl., vol. 1, no. 3, pp. 149-170, Mar. 1992.
20. G. D. Kazazakis and A. A. Argyros, "Fast positioning of limited visibility guards for the inspection of 2-D workspaces", in Proc. Int. Conf. Intell. Robots Syst., Lausanne, Switzerland, Sep. 2002, pp. 2843-2848.
21. R. Seidel, "A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons", Comput. Geomentry: Theory Appl., vol. 1, no. 1, pp. 51-64, Jul. 1991.
22. M. H. Overmars and E. Welzl, "New methods for computing visibility graphs", in Proc. 4th Annu. ACM Symp. Comput. Geomentry, New York, 1988, pp. 164-171.
23. J. S. B. Mitchell, "Shortest paths among obstacles in the plane", in Proc. 9th Annu. ACM Symp. Comput. Geomentry, San Diego, CA, 1993, pp. 308-317.
24. J. Hershberger and S. Suri, "An optimal algorithm for Euclidean shortest paths in the plane", SIAM J. Comput., vol. 28, no. 6, pp. 2215-2256, Dec. 1999.
25. Y.-J. Chiang and J. S. B. Mitchell, "Two-point Euclidean shortest path queries in the plane", in Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithms, Baltimore, MD, 1999, pp. 215-224.
26. J. Faigl, "Multi-goal path planning for cooperative sensing", Ph. D. dissertation, Dept. Cybern., Czech Tech. Univ., Prague, Czech Republic, 2010.
27. M. Kallmann, "Path planning in triangulations", in Proc. IJCAI Workshop Reason., Represent., Learn. Comput. Games, Edinburgh, Scotland, Jul. 2005, pp. 49-54.
28. T. Asano, "A new point-location algorithm and its practical efficiency: Comparison with existing algorithms", ACM Trans. Graph., vol. 3, no. 2, pp. 86-109, Apr. 1984.
29. O. Devillers, S. Pion, M. Teillaud, and P. Prisme, "Walking in a triangulation", Int. J. Found. Comput. Sci., vol. 13, pp. 106-114, May 2001.
30. J. R. Shewchuk, "Delaunay refinement algorithms for triangular mesh generation", Comput. Geometry: Theory Appl., vol. 22, pp. 1-3, May 2001.
31. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. (2010, July). Concorde TSP Solver [Online]. Available: http://www.tsp.gatech.edu/concorde.html
32. H. González-Baños, D. Hsu, and J. Latombe, "Motion planning: Recent developments", in Autonomous Mobile Robots: Sensing, Control, Decision-Making and Applications, S. Ge and F. Lewis, Eds. Boca Raton, FL: CRC Press, 2006, ch. 10.
33. E. U. Acar, H. Choset, and J. Y. Lee, "Sensor-based coverage with extended range detectors", IEEE Trans. Robot., vol. 22, no. 1, pp. 189-198, Feb. 2006.
34. D. Applegate, W. Cook, and A. Rohe, "Chained Lin-Kernighan for large traveling salesman problems", INFORMS J. Comput., vol. 15, no. 1, pp. 82-92, 2003.
35. B. Angéniol, G. de la C. Vaubois, and J.-Y. L. Texier., "Self-organizing feature maps and the travelling salesman problem", Neural Netw., vol. 1, no. 4, pp. 289-293, 1988.
36. T. Martinetz and K. Schulten, "Topology representing networks", Neural Netw., vol. 7, no. 3, pp. 507-522, 1994.