Research Repository

The 2013 Multi-objective Physical Travelling Salesman Problem Competition

Perez, D and Powley, E and Whitehouse, D and Samothrakis, S and Lucas, S and Cowling, PI (2014) The 2013 Multi-objective Physical Travelling Salesman Problem Competition. In: UNSPECIFIED, ? - ?.

[img]
Preview
Text
MOPTSPComp_CEC2014.pdf - Accepted Version

Download (416kB) | Preview

Abstract

© 2014 IEEE. This paper presents the game, framework, rules and results of the Multi-objective Physical Travelling Salesman Problem (MO-PTSP) Competition, that was held at the 2013 IEEE Conference on Computational Intelligence in Games (CIG). The MO-PTSP is a real-time game that can be seen as a modification of the Travelling Salesman Problem, where the player controls a ship that must visit a series of waypoints in a maze while minimizing three opposing goals: Time spent, fuel consumed and damage taken. The rankings of the competition are computed using multi-objective concepts, a novel approach in the field of game artificial intelligence competitions. The winning entry of the contest is also explained in detail. This controller is based on the Monte Carlo Tree Search algorithm, and employed Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for parameter tuning.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published proceedings: Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 15 Jul 2015 13:03
Last Modified: 30 Jan 2019 16:18
URI: http://repository.essex.ac.uk/id/eprint/14368

Actions (login required)

View Item View Item