Coevolving High-Level Representations

Several evolutionary simulations allow for a dynamic resizing of the genotype. This is an important alternative to constraining the genotype’s maximum size and complexity. In this paper, we add an additional dynamic to simulated evolution with the description of a genetic algorithm that coevolves its representation language with the genotypes. We introduce two mutation operators that permit the acquisition of modules from the genotypes during evolution. These modules form an increasingly highlevel representation language specific to the developmental environment. Experimental results illustrating interesting properties of the acquired modules and the evolved languages are provided.

[1]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[2]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[3]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[4]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[5]  R. Dawkins.  The Blind Watchmaker , 1986 .

[6]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  David E. Goldberg,et al.  Zen and the Art of Genetic Algorithms , 1989, ICGA.

[9]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[10]  Geoffrey E. Hinton,et al.  Distributed Representations , 1986, The Philosophy of Artificial Intelligence.

[11]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[12]  Stephanie Forrest,et al.  Emergent computation: self-organizing, collective, and cooperative phenomena in natural and artificial computing networks , 1990 .

[13]  Richard K. Belew,et al.  Evolving networks: using the genetic algorithm with connectionist learning , 1990 .

[14]  Thomas S. Ray,et al.  An Approach to the Synthesis of Life , 1991 .

[15]  John R. Koza,et al.  Genetic evolution and co-evolution of computer programs , 1991 .

[16]  R. A. Brooks,et al.  Intelligence without Representation , 1991, Artif. Intell..

[17]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[18]  Peter J. Angeline,et al.  Evolutionary Module Acquisition , 1993 .

[19]  Peter J. Angeline,et al.  An evolutionary algorithm that constructs recurrent neural networks , 1994, IEEE Trans. Neural Networks.

[20]  John F. Kolen,et al.  The observers' paradox: apparent computational complexity in physical systems , 1995, J. Exp. Theor. Artif. Intell..