The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress in coevolution. In this paper, a technique is developed that interfaces the LAPCA algorithm with NeuroEvolution of Augmenting Topologies (NEAT), a method to evolve neural networks with demonstrated efficiency in game playing domains. In addition, the behavior of LAPCA is analyzed for the first time in a complex game-playing domain: evolving neural network controllers for the game Pong. The technique is shown to keep the total number of evaluations in the order of those required by NEAT, making it applicable to complex domains. Pong players evolved with a LAPCA and with the Hall of Fame (HOF) perform equally well, but the LAPCA is shown to require significantly less space than the HOF. Therefore, combining NEAT and LAPCA is found to be an effective approach to coevolution.

PDF

In Proceedings of the Genetic and Evolutionary Computation Conference, 329-336, Seattle, Washington, July 2006. New York, NY: ACM Press.

@InProceedings{monroy:gecco06, title={Coevolution of Neural Networks using a Layered Pareto Archive}, author={German A. Monroy and Kenneth O. Stanley and Risto Miikkulainen}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, month={July}, address={Seattle, Washington}, publisher={New York, NY: ACM Press}, pages={329-336}, url="http://nn.cs.utexas.edu/?monroy:gecco06", year={2006} }