An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

An application of the self-organizing map (SOM) to the Traveling Salesman Problem (TSP) has been reported by many researchers, however these approaches are mainly focused on the Euclidean TSP variant. We consider the TSP as a problem formulation for the multi-goal path planning problem in which paths among obstacles have to be found. We apply a simple approximation of the shortest path that seems to be suitable for the SOM adaptation procedure. The approximation is based on a geometrical interpretation of SOM, where weights of neurons represent nodes that are placed in the polygonal domain. The approximation is verified in a set of real problems and experimental results show feasibility of the proposed approach for the SOM based solution of the non-Euclidean TSP.

[1]  Marco Budinich,et al.  A Self-Organizing Neural Network for the Traveling Salesman Problem That Is Competitive with Simulated Annealing , 1996, Neural Computation.

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

[3]  B. John Oommen,et al.  The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem , 1999, Neural Networks.

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

[5]  Fred W. Glover,et al.  Construction heuristics for the asymmetric TSP , 2001, Eur. J. Oper. Res..

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

[7]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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

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

[10]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[11]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[12]  Laura Burke,et al.  "Conscientious" neural nets for tour construction in the traveling salesman problem: the vigilant net , 1996, Comput. Oper. Res..

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

[14]  Olivier Devillers,et al.  Walking in a Triangulation , 2002, Int. J. Found. Comput. Sci..

[15]  Jun Ota,et al.  Coordinated motion control of a robot arm and a positioning table with arrangement of multiple goals , 2008, 2008 IEEE International Conference on Robotics and Automation.

[16]  J. Fort.  Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem , 1988, Biological Cybernetics.

[17]  Tim Roughgarden,et al.  Planning Tours of Robotic Arms among Partitioned Goals , 2006, Int. J. Robotics Res..

[18]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[19]  Aristides A. G. Requicha,et al.  Multiple-goals path planning for coordinate measuring machines , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

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

[22]  Kwong-Sak Leung,et al.  An expanding self-organizing neural network for the traveling salesman problem , 2004, Neurocomputing.

[23]  Laura I. Burke,et al.  The guilty net for the traveling salesman problem , 1992, Comput. Oper. Res..

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

[25]  Lydia E. Kavraki,et al.  Randomized planning for short inspection paths , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[26]  L. Preucil,et al.  Cooperative planning for heterogeneous teams in rescue operations , 2005, IEEE International Safety, Security and Rescue Rototics, Workshop, 2005..

[27]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[28]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[29]  Zygmunt Pizlo,et al.  Non-Euclidean Traveling Salesman Problem , 2008 .

[30]  Libor Preucil,et al.  A Sensor Placement Algorithm for a Mobile Robot Inspection Planning , 2011, J. Intell. Robotic Syst..

[31]  Forschungsinstitut für Diskrete.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003 .

[32]  Takeshi Yamakawa,et al.  Self-Organizing Map with Input Data Represented as Graph , 2006, ICONIP.