An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective

Computational Intelligence and Neuroscience

Volumn 2016, Issue , 2016, Pages

  Faigl, Jan ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMAL MAPPING; GRAPH THEORY; ROBOT PROGRAMMING; ROBOTICS; SELF ORGANIZING MAPS; TRAVELING SALESMAN PROBLEM; UNSUPERVISED LEARNING;

COLLISION-FREE PATHS; INSPECTION TASKS; MINMAX OBJECTIVE; MULTIPLE TRAVELING SALESMAN PROBLEMS (MTSP); MULTIROBOTS; POLYGONAL DOMAIN; ROBOTIC PROBLEMS; SHORTEST PATH;

MOTION PLANNING;

ALGORITHM; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; DEPTH PERCEPTION; HUMAN; MOTION; ROBOTICS; TRAVEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; HUMANS; MOTION; NEURAL NETWORKS (COMPUTER); PATTERN RECOGNITION, AUTOMATED; ROBOTICS; SPACE PERCEPTION; TRAVEL;

EID: 84975316786     PISSN: 16875265     EISSN: 16875273     Source Type: Journal    
DOI: 10.1155/2016/2720630     Document Type: Article

References (47)

1. T. Kohonen, M. R. Schroeder, T. S. Huang, Eds., Self-Organizing Maps, Springer, Berlin, Germany, 3rd edition, 2001.
2. D. L. Applegate, R. E. Bixby, V. Chv tal, W. J. Cook, The Traveling Salesman Problem: A Computational Study, Princeton University Press, Princeton, NJ, USA, 2006.
3. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem, " Operations Research, vol. 21, no. 2, pp. 498-516, 1973.
4. K. Helsgaun, "An effective implementation of the Lin-Kernighan traveling salesman heuristic, " European Journal of Operational Research, vol. 126, no. 1, pp. 106-130, 2000.
5. B. Ang niol, G. de La Croix Vaubois, J.-Y. Le Texier, "Selforganizing feature maps and the travelling salesman problem, " Neural Networks, vol. 1, no. 4, pp. 289-293, 1988.
6. J.-C. Fort, "Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem, " Biological Cybernetics, vol. 59, no. 1, pp. 33-40, 1988.
7. L. I. Burke, "Neural methods for the traveling salesman problem: insights fromoperations research, " Neural Networks, vol. 7, no. 4, pp. 681-690, 1994.
8. S. Somhom, A. Modares, T. Enkawa, "A self-organising model for the travelling salesman problem, " Journal of the Operational Research Society, vol. 48, no. 9, pp. 919-928, 1997.
9. N. Aras, B. J. Oommen, I. K. Altinel, "The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem, " Neural Networks, vol. 12, no. 9, pp. 1273-1284, 1999.
10. E. M. Cochrane and J. E. Beasley, "The co-adaptive neural network approach to the Euclidean travelling salesman problem, " Neural Networks, vol. 16, no. 10, pp. 1499-1525, 2003.
11. J.-C. Cr put andA. Koukam, "Amemetic neural network for the Euclidean traveling salesman problem, " Neurocomputing, vol. 72, no. 4-6, pp. 1250-1264, 2009.
12. J. Faigl, "On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain, " Information Sciences, vol. 181, no. 19, pp. 4214-4229, 2011.
13. K. Smith, M. Palaniswami, M. Krishnamoorthy, "Neural techniques for combinatorial optimization with applications, " IEEE Transactions on Neural Networks, vol. 9, no. 6, pp. 1301-1318, 1998.
14. H. Ghaziri and I. H. Osman, "A neural network algorithm for the traveling salesman problemwith backhauls, " Computers and Industrial Engineering, vol. 44, no. 2, pp. 267-281, 2003.
15. A. Modares, S. Somhom, T. Enkawa, "A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems, " International Transactions in Operational Research, vol. 6, no. 6, pp. 591-606, 1999.
16. S. Somhom, A. Modares, T. Enkawa, "Competition-based neural network for the multiple travelling salesmen problem with minmax objective, " Computers & Operations Research, vol. 26, no. 4, pp. 395-407, 1999.
17. S. Alatartsev, S. Stellmacher, F. Ortmeier, "Robotic task sequencing problem: a survey, " Journal of Intelligent and Robotic Systems: Theory and Applications, vol. 80, no. 2, pp. 279-298, 2015.
18. J. Faigl, M. Kulich, V. Von sek, L. P reu cil, "An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem, " Neurocomputing, vol. 74, no. 5, pp. 671-679, 2011.
19. T. Bektas, "The multiple traveling salesman problem: an overview of formulations and solution procedures, "Omega, vol. 34, no. 3, pp. 209-219, 2006.
20. J. Faigl, Multi-goal path planning for cooperative sensing [Ph. D. thesis], Czech Technical University in Prague, 2010.
21. J. Faigl, "Approximate solution of themultiple watchman routes problem with restricted visibility range, " IEEE Transactions on Neural Networks, vol. 21, no. 10, pp. 1668-1679, 2010.
22. P. M. Franc, M. Gendreau, G. Laporte, F. M. M ller, "The m-traveling salesman problem with minmax objective, " Transportation Science, vol. 29, no. 3, pp. 267-275, 1995.
23. M. Saha, T. Roughgarden, J.-C. Latombe, G. Snchez-Ante, "Planning tours of robotic arms among partitioned goals, " The International Journal of Robotics Research, vol. 25, no. 3, pp. 207-223, 2006.
24. L. B. Gueta, R. Chiba, J. Ota, T. Ueyama, T. Arai, "Coordinated motion control of a robot arm and a positioning table with arrangement of multiple goals, " in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '08), pp. 2252-2258, Pasadena, Calif, USA, May 2008.
25. J. H. Reif, "Complexity of the mover's problem and generalizations, " in Proceedings of the 20th Annual Symposium on Foundations of ComputerScience (SFCS '79), pp. 421-427, IEEE Computer Society, October 1979.
26. S. N. Spitz and A. A. G. Requicha, "Multiple-goals path planning for coordinate measuring machines, " in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '00), pp. 2322-2327, San Francisco, Calif, USA, April 2000.
27. T. Danner and L. E. Kavraki, "Randomized planning for short inspection paths, " in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '00), vol. 2, pp. 971-976, San Francisco, Calif, USA, April 2000.
28. H. Gonz lez-Baños, D. Hsu, J.-C. Latombe, "Motion planning: recent developments, " in Autonomous Mobile Robots: Sensing, Control, Decision-Making and Applications, S. Ge andF. Lewis, Eds., chapter 10, CRC Press, New York, NY, USA, 2006.
29. H. Gonz lez-Baños, "A randomized art-gallery algorithm for sensor placement, " in Proceedings of the 17th Annual Symposium on Computational Geometry (SCG '01), pp. 232-240, New York, NY, USA, June 2001.
30. G. D. Kazazakis and A. A. Argyros, "Fast positioning of limited-visibility guards for the inspection of 2D workspaces, " in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '02), vol. 3, pp. 2843-2848, Lausanne, Switzerland, September 2002.
31. J. Faigl and M. Kulich, "Sensing locations positioning formultirobot inspection planning, " in IEEE Workshop on Distributed Intelligent Systems-Collective Intelligence and Its Applications (DIS '06), pp. 79-84, Prague, Czech Republic, June 2006.
32. J. Faigl, M. Kulich, L. Preucil, "A sensor placement algorithm for a mobile robot inspection planning, " Journal of Intelligent & Robotic Systems, vol. 62, no. 3, pp. 329-353, 2011.
33. M. G. Lagoudakis, E. Markakis, D. Kempe et al., "Auction-based multi-robot routing, " in Robotics: Science and Systems, S. Thrun, G. S. Sukhatme, S. Schaal, Eds., pp. 343-350, The MIT Press, 2005.
34. P. Kalina, J. Vokrek, V. Mar, "Agents toward vehicle routing problem with time windows, " Journal of Intelligent Transportation Systems: Technology, Planning, Operations, vol. 19, no. 1, pp. 3-17, 2015.
35. S. Yuan, B. Skinner, S. Huang, D. Liu, "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms, " European Journal of Operational Research, vol. 228, no. 1, pp. 72-82, 2013.
36. M. Bellmore and S. Hong, "Transformation of multisalesmen problem to the standard traveling salesman problem, " Journal of the Association for Computing Machinery, vol. 21, no. 3, pp. 500-504, 1974.
37. L. Bertazzi, B. Golden, X. Wang, "Min-max vs. min-sum vehicle routing: a worst-case analysis, " European Journal of Operational Research, vol. 240, no. 2, pp. 372-381, 2015.
38. I. Vallivaara, "A Teamant colony optimization algorithm for the multiple travelling salesmen problem with MinMax objective, " in Proceedings of the 27th IASTED International Conference on Modelling, Identification, Control, pp. 387-392, ACTAPress, February 2008.
39. J. Kubal and J. Faigl, "Iterative prototype optimization with evolved improvement steps, " in Proceedings of the 9th European Conference on Genetic Programming (EuroGP '06), pp. 154-165, Budapest, Hungary, April 2006.
40. J. Kubal, J. Kl ma, M. Kulich, "Application of soft computing techniques to rescue operation planning, " in Proceedings of the 7th International Conference on Artificial Intelligence and Soft Computing (ICAISC '04), pp. 897-902, June 2004.
41. M. Kulich, J. Faigl, J. Kl ma, J. Kubal, "Rescue operation planning by soft computing techniques, " in Proceedings of the IEEE 4th International Conference on Intelligent Systems Design and Application, vol. 1-2, pp. 103-108, IEEE, Budapest, Hungary, August 2004.
42. M. Gendreau, A. Hertz, G. Laporte, "New insertion and postoptimization procedures for the traveling salesman problem, " Operations Research, vol. 40, no. 6, pp. 1086-1094, 1992.
43. M. H. Overmars and E. Welzl, "New methods for computing visibility graphs (SCG '88), " in Proceedings of the 4th Annual Symposium On Computational Geometry, pp. 164-171, Urbana-Champaign, Ill, USA, June 1988.
44. M. Edahiro, I. Kokubo, T. Asano, "A new pointlocation algorithm and its practical efficiency: comparison with existing algorithms, "ACMTransactions onGraphics, vol. 3, no. 2, pp. 86-109, 1984.
45. M. Kallmann, "Path planning in triangulations, " in Proceedings of the IJCAIWorkshop on Reasoning, Representation, Learning in Computer Games, pp. 49-54, Edinburgh, Scotland, 2005.
46. O. Devillers, S. Pion, M. Teillaud, "Walking in a triangulation, " International Journal of Foundations of Computer Science, vol. 13, no. 2, pp. 181-199, 2002.
47. A. Plebe and A. M. Anile, "A neural-network-based approach to the double traveling salesman problem, " Neural Computation, vol. 14, no. 2, pp. 437-471, 2002.