|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Bucci, A. & Pollack, J. B. (2002). A mathematical framework for the study of coevolution. Foundations of Genetic Algorithms 7, Proceedings of FOGA VII, 221--236.
|
| |
2
|
|
| |
3
|
|
| |
4
|
De Jong, E. D. (2004). The incremental Pareto-coevolution archive. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-04, 525--536.
|
| |
5
|
De Jong, E. D. (2004). Towards a bounded Pareto-coevolution archive. Proceedings of the Congress on Evolutionary Computation CEC-04, 2341--2348.
|
| |
6
|
De Jong, E. D., & Pollack, J. B. (2003). Learning the ideal evaluation function. Proceedings of the 2003 Genetic and Evolutionary Computation Conference, 277--288.
|
| |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
Ficici, S. G., & Pollack, J. B. (2003). A game-theoretic memory mechanism for coevolution. Proceedings of the 2003 Genetic and Evolutionary Computation Conference, 286--297.
|
| |
11
|
Floreano, D., & Nolfi, S. (1997). God save the Red Queen! Competition in co-evolutionary robotics. Genetic Programming 1997: Proceedings of the Second Annual Conference, 398--406.
|
| |
12
|
Noble, J., & Watson, R. A. (2001). Pareto coevolution: Using performance against coevolved opponents in a game as dimensions for Pareto selection. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, 493--500.
|
| |
13
|
Poppleton, T. (2002). Can co-evolution play ball? Competitive co-evolution in a Pong game. Unpublished master's thesis, University of Sussex, UK. Retrieved August 6, 2005, from http://www.informatics.susx.ac.uk/easy/Publications/Online/MSc2002/ajp25.pdf
|
| |
14
|
Rosin, C. D., & Belew, R. K. (1997). New methods for competitive evolution. Evolutionary Computation, 5, 1--29.
|
| |
15
|
Stanley, K., Bryant, B. D., & Miikkulainen, R. (2005). Real-time neuroevolution in the NERO video game. IEEE Transactions on Evolutionary Computation, 9(6), 653--668.
|
| |
16
|
|
| |
17
|
Stanley, K. O., & Miikkulainen, R. (2002). Efficient evolution of neural network topologies. Proceedings of the 2002 Congress on Evolutionary Computation (CEC '02), 2, 1757--1762.
|
| |
18
|
|
| |
19
|
|
| |
20
|
Stanley, K. O., & Miikkulainen, R. (2003). Achieving high-level functionality through Complexification. Proceedings of the AAAI-2003 Spring Symposium on Computational Synthesis, 226--232.
|
| |
21
|
Stanley, K. O., & Miikkulainen, R. (2004). Competitive coevolution through evolutionary complexification. Journal of Artificial Intelligence Research, 21, 63--100.
|
| |
22
|
|
| |
23
|
Winter, D. (2005). Magnavox Odyssey: First home video game console. Retrieved August 6, 2005, from http://www.pong-story.com/odyssey.htm
|
|