The physical travelling salesman problem: WCCI 2012 competition

Numerous competitions have emerged in recent years that allow researchers to evaluate their algorithms on a variety of real-time video games with different degrees of complexity. These competitions, which vary from classical arcade games like Ms Pac-Man to racing simulations (Torcs) and realtime strategy games (StarCraft), are essential to establish a uniform testbed that allows practitioners to refine their algorithms over time. In this paper we propose a new competition to be held for the first time at WCCI 2012: the Physical Travelling Salesman Problem is an open-ended single-player real-time game that removes some of the complexities evident in other video games while preserving some of the most fundamental challenges. This paper motivates and outlines the PTSP and discusses in detail the framework of the competition, including software interfaces, parameter settings, rules and details of submission.

[1]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[2]  Stéphane Donikian,et al.  Crowd of Virtual Humans: a New Approach for Real Time Navigation in Complex and Structured Environments , 2004, Comput. Graph. Forum.

[3]  Luke Perkins,et al.  Terrain Analysis in Real-Time Strategy Games: An Integrated Approach to Choke Point Detection and Region Decomposition , 2010, AIIDE.

[4]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[5]  M.C.S. Boeres,et al.  A faster elastic-net algorithm for the traveling salesman problem , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.

[6]  Julian Togelius,et al.  The 2009 Simulated Car Racing Championship , 2010, IEEE Transactions on Computational Intelligence and AI in Games.

[7]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[8]  Narendra Ahuja,et al.  A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..

[9]  Simon M. Lucas,et al.  Ms Pac-Man versus Ghost Team CEC 2011 competition , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[10]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[11]  Simon M. Lucas,et al.  Monte-Carlo Tree Search for the Physical Travelling Salesman Problem , 2012, EvoApplications.

[12]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[13]  F. Favata,et al.  A study of the application of Kohonen-type neural networks to the Travelling Salesman Problem , 1991, Biological Cybernetics.

[14]  W. Marsden.  I and J , 2012 .

[15]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[16]  Arnav Jhala,et al.  Building Human-Level AI for Real-Time Strategy Games , 2011, AAAI Fall Symposium: Advances in Cognitive Systems.

[17]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[18]  R. Brady.  Optimization strategies gleaned from biological evolution , 1985, Nature.

[19]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[20]  Gregory S. Chirikjian,et al.  A new potential field method for robot path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[21]  Philip Hingston,et al.  A new design for a Turing Test for Bots , 2010, Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games.

[22]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

[23]  Anthony Brabazon,et al.  Reactiveness and navigation in computer games: Different needs, different approaches , 2011, 2011 IEEE Conference on Computational Intelligence and Games (CIG'11).

[24]  Simon M. Lucas,et al.  Ms Pac-Man competition , 2007, SEVO.

[25]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[26]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[27]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[28]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[29]  D. Hunter Hale,et al.  Automatically-generated Convex Region Decomposition for Real-time Spatial Agent Navigation in Virtual Worlds , 2021, AIIDE.

[30]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[31]  Craig W. Reynolds.  Steering Behaviors For Autonomous Characters , 1999 .

[32]  Julian Togelius,et al.  The 2009 Mario AI Competition , 2010, IEEE Congress on Evolutionary Computation.

[33]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[34]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.