Inspection planning in the polygonal domain by self-organizing map

Applied Soft Computing Journal

Volumn 11, Issue 8, 2011, Pages 5028-5041

  Faigl, Jan ^a   Přeučil, Libor ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Inspection planning; Multi goal path planning; Polygonal domain; Self Organizing Map (SOM); Traveling Salesman Problem (TSP); Watchman Route Problem (WRP)

Indexed keywords

INSPECTION PLANNING; POLYGONAL DOMAIN; SELF ORGANIZING; TRAVELING SALESMAN; WATCHMAN ROUTE PROBLEM;

ALGORITHMS; CONFORMAL MAPPING; INSPECTION; MOTION PLANNING; ROBOT PROGRAMMING;

TRAVELING SALESMAN PROBLEM;

EID: 80053568989     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2011.05.055     Document Type: Article

References (35)

1. H.H. González-Baños, D. Hsu, and J.-C. Latombe Motion planning: recent developments S.S. Ge, F.L. Lewis, Autonomous Mobile Robots: Sensing, Control, Decision-Making and Applications 2006 CRC Press (Chapter 10)
2. W.-P. Chin, and S. Ntafos Optimum watchman routes SCG'86: Proceedings of the Second Annual Symposium on Computational Geometry 1986 ACM Press Yorktown Heights, New York, United States 24 33
3. E. Packer, Robust Geometric Computing and Optimal Visibility Coverage, PhD Thesis, Stony Brook University, New York, 2008.
4. J.C. Culberson, and R.A. Reckhow Covering polygons is hard Journal of Algorithms 17 1 1994 2 44
5. S.N. Spitz, and A.A.G. Requicha Multiple-goals path planning for coordinate measuring machines Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2000 2322 2327
6. M. Saha, G. Sánchez-Ante, and J.-C. Latombe Planning multigoal tours for robot arms Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), vol. 3 2003 3797 3803
7. X. Tan, and T. Hirata Finding shortest safari routes in simple polygons Information Processing Letters 87 4 2003 179 186
8. T. Danner, and L.E. Kavraki Randomized planning for short inspection paths Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) 2000 IEEE Press San Fransisco, CA 971 976
9. J. Faigl, and M. Kulich Sensing locations positioning for multi-robot inspection planning DIS'06: Proceedings of the IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and its Applications 2006 IEEE Computer Society Washington, DC, USA 79 84 (Pubitemid 44889084)
10. J. Faigl, M. Kulich, and L. Přeučil A sensor placement algorithm for a mobile robot inspection planning J. Intell. Robotic Syst. 62 3 2011 329 353
11. V. Chvátal, W. Cook, G.B. Dantzig, D.R. Fulkerson, and S.M. Johnson Solution of a Large-Scale Traveling-Salesman Problem 2010 Springer Berlin Heidelberg pp. 7-28 (Chapter 1)
12. S. Ghafurian, and N. Javadian An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems Applied Soft Computing 11 January (1) 2011 1256 1262
13. E.M. Cochrane, and J.E. Beasley The co-adaptive neural network approach to the Euclidean travelling salesman problem Neural Networks 16 10 2003 1499 1525 (Pubitemid 37386365)
14. T.A.S. Masutti, and L.N. de Castro A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem Information Sciences 179 10 2009 1454 1468
15. J. Faigl Approximate solution of the multiple watchman routes problem with restricted visibility range IEEE Transactions on Neural Networks 21 10 2010 1668 1679
16. S. Somhom, A. Modares, and T. Enkawa A self-organising model for the travelling salesman problem Journal of the Operational Research Society 48 1997 919 928
17. G.D. Kazazakis, and A.A. Argyros Fast positioning of limited visibility guards for the inspection of 2d workspaces Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) Lausanne, Switzerland, 2002 September 2002
18. R. Seidel A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons Computational Geometry 1 1 1991 51 64
19. M.H. Overmars, and E. Welzl New methods for computing visibility graphs SCG'88: Proceedings of the Fourth Annual Symposium on Computational Geometry 1988 ACM New York, NY, USA 164 171
20. D. Applegate, R. Bixby, V. Chvátal, W. Cook. CONCORDE TSP Solver. http://www.tsp.gatech.edu/concorde.html, 2003 (cited 8 July 2010).
21. B. Angéniol, G. de la, C. Vaubois, and J-Y.L. Texier Self-organizing feature maps and the travelling salesman problem Neural Networks 1 1988 289 293
22. J.C. Fort. Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem Biological Cybernetics 59 1 1988 33 40
23. A. Plebe, and A.M. Anile A neural-network-based approach to the double traveling salesman problem Neural Computing 14 2 2002 437 471
24. F.C. Vieira, A.D.D. Neto, and J.A. Costa An efficient approach to the travelling salesman problem using self-organizing maps International Journal of Neural Systems 13 2 2003 59 66
25. Y. Bai, W. Zhang, and Z. Jin An new self-organizing maps strategy for solving the traveling salesman problem Chaos, Solitons & Fractals 28 4 2006 1082 1089 (Pubitemid 41607610)
26. R. Gerhard TSPLIB - a traveling salesman problem library Journal on Computing 3 4 1991 376 384
27. S. Somhom, A. Modares, and T. Enkawa Competition-based neural network for the multiple travelling salesmen problem with minmax objective Computers and Operations Research 26 4 1999 395 407 (Pubitemid 29346468)
28. W. Zhang, Y. Bai, and H.P. Hu The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP Applied Mathematics and Computation 172 1 2006 603 623 (Pubitemid 43132865)
29. J. Faigl, Multi-Goal Path Planning for Cooperative Sensing, PhD Thesis, Czech Technical University in Prague, 2010.
30. M. Kallmann Path planning in triangulations Proceedings of the IJCAI Workshop on Reasoning, Representation, and Learning in Computer Games Edinburgh, Scotland, July 31 2005
31. O. Devillers, S. Pion, M. Teillaud, and P. Prisme Walking in a triangulation International Journal of Foundations of Computer Science 13 2001 106 114 (Pubitemid 32865852)
32. J. Faigl, M. Kulich, V. Vonásek, and L. Přeučil An application of self-organizing map in the non-Euclidean traveling salesman problem Neurocomputing 74 5 2011 671 679
33. L Burke "Conscientious" neural nets for tour construction in the traveling salesman problem: the vigilant net Computers and Operations Research 23 2 1996 121 129
34. L. Přeučil, J. Pavlček, R. Mázl, F. Driewer, and K. Schilling Next generation human-robot telematic teams Multidisciplinary Collaboration for Socially Assistive Robotics 2007 AAAI Press Menlo Park, CA pp. 65-69
35. J.R. Shewchuk Delaunay refinement algorithms for triangular mesh generation Computational Geometry: Theory and Applications 22 2001 1 3