Competitive coevolution through evolutionary complexification

作者: K. O. Stanley , R. Miikkulainen

DOI: 10.1613/JAIR.1338

关键词: Artificial neural networkRobotHyperNEATCoevolutionNeuroevolution of augmenting topologiesDomain (software engineering)NeuroevolutionArtificial intelligenceComputer scienceComplexification

摘要: Two major goals in machine learning are the discovery and improvement of solutions to complex problems. In this paper, we argue that complexification, i.e. incremental elaboration through adding new structure, achieves both these goals. We demonstrate power complexification NeuroEvolution Augmenting Topologies (NEAT) method, which evolves increasingly neural network architectures. NEAT is applied an open-ended coevolutionary robot duel domain where controllers compete head head. Because supports a wide range strategies, because coevolution benefits from escalating arms race, it serves as suitable testbed for studying complexification. When compared evolution networks with fixed complexifying discovers significantly more sophisticated strategies. The results suggest order discover improve solutions, evolution, search general, should be allowed complexify well optimize.

参考文章(51)
Scott Brave, Evolving deterministic finite automata using cellular encoding Proceedings of the 1st annual conference on genetic programming. pp. 39- 44 ,(1996)
Melanie Mitchell, James P Crutchfield, Rajarshi Das, Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work ,(2000)
Conor Ryan, Pygmies and civil servants Advances in genetic programming. pp. 243- 263 ,(1994)
Heinz Mühlenbein, Byoung-Tak Zhang, Evolving Optimal Neural Networks Using Genetic Algorithms with Occam's Razor. Complex Systems. ,vol. 7, ,(1993)
John R. Koza, Gene duplication to enable genetic programming to concurrently evolve both the architecture and work-performing steps of a computer program international joint conference on artificial intelligence. pp. 734- 740 ,(1995)
Julian F. Miller, Dominic Job, Vesselin K. Vassilev, Principles in the Evolutionary Design of Digital Circuits—Part II Genetic Programming and Evolvable Machines. ,vol. 1, pp. 259- 288 ,(2000) , 10.1023/A:1010066330916
Sevan G. Ficici, Jordan B. Pollack, Pareto Optimality in Coevolutionary Learning european conference on artificial life. pp. 316- 325 ,(2001) , 10.1007/3-540-44811-X_34
Peter J. Angeline, Jordan B. Pollack, Competitive Environments Evolve Better Solutions for Complex Tasks international conference on genetic algorithms. pp. 264- 270 ,(1993)
C. C. Maley, Four steps toward open-ended evolution genetic and evolutionary computation conference. pp. 1336- 1343 ,(1999)
Richard A. Watson, Jason Noble, Pareto coevolution: using performance against coevolved opponents in a game as dimensions for Pareto selection genetic and evolutionary computation conference. pp. 493- 500 ,(2001)