Genetically breeding populations of computer programs to solve problems in artificial intelligence

The authors describe the genetic programming paradigm, which genetically breeds populations of computer programs to solve problems. In genetic programming, the individuals in the population are hierarchical computer programs of various sizes and shapes. Applications to three problems in artificial intelligence are presented. The first problem involves genetically breeding a population of computer programs to allow an 'artificial ant' to traverse an irregular trail. The second problem involves genetically breeding a minimax control strategy in a different game with an independently acting pursuer and evader. The third problem involves genetically breeding a minimax strategy for a player of a simple discrete two-person game represented by a game tree in extensive form.<<ETX>>

[1]  Richard M. Friedberg,et al.  A Learning Machine: Part I , 1958, IBM J. Res. Dev..

[2]  Rufus Isaacs,et al.  Differential Games , 1965 .

[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]  Stephen F. Smith,et al.  A learning system based on genetic adaptive algorithms , 1980 .

[5]  John R. Anderson,et al.  MACHINE LEARNING An Artificial Intelligence Approach , 2009 .

[6]  Nichael Lynn Cramer,et al.  A Representation for the Adaptive Generation of Simple Sequential Programs , 1985, ICGA.

[7]  John J. Grefenstette,et al.  Genetic algorithms and their applications , 1987 .

[8]  Kenneth A. De Jong,et al.  Genetic algorithms: A 10 Year Perspective , 1985, ICGA.

[9]  P. Anandan,et al.  Cooperativity in Networks of Pattern Recognizing Stochastic Learning Automata , 1986 .

[10]  John H. Holland,et al.  Escaping brittleness: the possibilities of general-purpose learning algorithms applied to parallel rule-based systems , 1995 .

[11]  John Dickinson,et al.  Using the Genetic Algorithm to Generate LISP Source Code to Solve the Prisoner's Dilemma , 1987, ICGA.

[12]  Clive Richards,et al.  The Blind Watchmaker , 1987, Bristol Medico-Chirurgical Journal.

[13]  Kenneth A. De Jong,et al.  On Using Genetic Algorithms to Search Program Spaces , 1987, ICGA.

[14]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

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

[16]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[17]  D.E. Goldberg,et al.  Classifier Systems and Genetic Algorithms , 1989, Artif. Intell..

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

[19]  John R. Koza,et al.  Hierarchical Genetic Algorithms Operating on Populations of Computer Programs , 1989, IJCAI.

[20]  John R. Koza,et al.  Genetic breeding of non-linear optimal control strategies for broom balancing , 1990 .

[21]  John R. Koza,et al.  Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems , 1990 .

[22]  Ryszard S. Michalski,et al.  Machine learning: an artificial intelligence approach volume III , 1990 .

[23]  John R. Koza,et al.  A GENETIC APPROACH TO ECONOMETRIC MODELING , 1992 .