An introduction to genetic algorithms
An introduction to genetic algorithms
ALIFE Proceedings of the sixth international conference on Artificial life
Tracking the Red Queen: Measurements of Adaptive Progress in Co-Evolutionary Simulations
Proceedings of the Third European Conference on Advances in Artificial Life
Chemical genetic algorithms: coevolution between codes and code translation
ICAL 2003 Proceedings of the eighth international conference on Artificial life
Learning the ideal evaluation function
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
The game of tag is frequently used in the study of pursuit and evasion strategies that are discovered through competitive coevolution. The aim of coevolution is to create an arms race where opposing populations cyclically evolve in incremental improvements, driving the system towards better strategies. A coevolutionary simulation of the game of tag involving two populations of agents; pursuers and evaders, is developed to investigate the effects of a boundary and two obstacles. The evolution of strategies through Chemical Genetic Programming optimizes the mapping of genotypic strings to phenotypic trees. Four experiments were conducted, distinguished by speed differentials and environmental conditions. Designing experiments to evaluate the efficacy of emergent strategies often reveal necessary steps needed for coevolutionary progress. The experiments that excluded obstacles and boundaries provided design pointers to ensure coevolutionary progress as well as a deeper understanding of strategies that emerged when obstacles and boundaries were added. In the latter, we found that an awareness of the environment and the pursuer was not critical in an evader's strategy to survive, instead heading to the edge of the boundary or behind an obstacle in a bid to `throw-off or hide from the pursuer' or simply turn in circles was often sufficient, thereby revealing possible suboptimal strategies that were environment specific. We also observed that a condition for coevolutionary progress was that the problem complexity must be surmountable by at least one population; that is, some pursuer must be able to tag an opponent. Due to the use of amino-acid building blocks in our Chemical Genetic Program, our simulations were able to achieve significant complexity in a short period of time.