Competition-Based Learning

This paper summarizes recent research on competition-based learning procedures performed by the Navy Center for Applied Research in Artificial Intelligence at the Naval Research Laboratory. We have focused on a particularly interesting class of competition-based techniques called genetic algorithms. Genetic algorithms are adaptive search algorithms based on principles derived from the mechanisms of biological evolution. Recent results on the analysis of the implicit parallelism of alternative selection algorithms are summarized, along with an analysis of alternative crossover operators. Applications of these results in practical learning systems for sequential decision problems and for concept classification are also presented.

[1]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[2]  Alan C. Schultz,et al.  Using a Genetic Algorithm to Learn Strategies for Collision Avoidance and Local Navigation. , 1990 .

[3]  John J. Grefenstette,et al.  Lamarckian Learning in Multi-Agent Environments , 1991, ICGA.

[4]  John J. Grefenstette,et al.  Improving tactical plans with genetic algorithms , 1990, [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence.

[5]  Diana F. Gordon.  Improving the Comprehensibility, Accuracy, and Generality of Reactive Plans , 1991 .

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

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

[8]  Kenneth A. De Jong,et al.  Using genetic algorithms for supervised concept learning , 1990, [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence.

[9]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

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

[12]  John J. Grefenstette,et al.  Conditions for Implicit Parallelism , 1990, FOGA.

[13]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

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

[15]  John J. Grefenstette,et al.  Learning the Persistence of Actions in Reactive Control Rules , 1991, ML.

[16]  John J. Grefenstette,et al.  Simulation-Assisted Learning by Competition: Effects of Noise Differences Between Training Model and Target Environment , 1990, ML.

[17]  Kenneth de Jong,et al.  Genetic-algorithm-based learning , 1990 .

[18]  Diana F. Gordon.  An enhancer for reactive plans , 1991 .

[19]  William M. Spears,et al.  A Study of Crossover Operators in Genetic Programming , 1991, ISMIS.