Solving Five Instances of the Artificial Ant Problem with Ant Colony Optimization

Abstract The Artificial Ant problem is a common benchmark problem often used for metaheuristic algorithm performance evaluation. The problem is to find a strategy controlling an agent (called an Artificial Ant) in a game performed on a square toroidal field. Some cells of the field contain “food” pellets, which are distributed along a certain trail. In this paper we use Finite-State Machines (FSM) for strategy representation and present a new algorithm –MuACO sm – for learning finite-state machines. The new algorithm is based on an Ant Colony Optimization algorithm (ACO) and a graph representation of the search space. We compare the new algorithm with a genetic algorithm (GA), evolutionary strategies (ES), a genetic programming related approach and reinforcement learning on five instances of the Artificial Ant Problem.

[1]  William M. Spears,et al.  Evolving Finite-State Machine Strategies for Protecting Resources , 2000, ISMIS.

[2]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[3]  Conor Ryan,et al.  Sensitive ants are sensible ants , 2012, GECCO '12.

[4]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[5]  Yoshikazu Fukuyama,et al.  A particle swarm optimization for reactive power and voltage control considering voltage security assessment , 2000 .

[6]  Steffen Christensen,et al.  Solving the artificial ant on the Santa Fe trail problem in 20,696 fitness evaluations , 2007, GECCO '07.

[7]  Cezary Z. Janikow,et al.  CGP visits the Santa Fe trail: effects of heuristics on GP , 2005, GECCO '05.

[8]  Stefan Preitl,et al.  Fuzzy Control Systems With Reduced Parametric Sensitivity Based on Simulated Annealing , 2012, IEEE Transactions on Industrial Electronics.

[9]  Daniil Chivilikhin,et al.  Test-based extended finite-state machines induction with evolutionary algorithms and ant colony optimization , 2012, GECCO '12.

[10]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[11]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[12]  DaeEun Kim,et al.  Memory analysis and significance test for agent behaviours , 2006, GECCO.

[13]  Simon M. Lucas,et al.  Learning Finite-State Transducers: Evolution Versus Heuristic State Merging , 2007, IEEE Transactions on Evolutionary Computation.

[14]  Daniil Chivilikhin,et al.  Learning Finite-State Machines with Ant Colony Optimization , 2012, ANTS.

[15]  Bertrand Mesot,et al.  SOS++: finding smart behaviors using learning and evolution , 2002 .