Generating novel tactics through evolutionary computation

ABSTRACT

Simulated evolution on a computer can provide a means for generating appropriate tactics in real-time combat scenarios. Individual unit or higher level organizations, such as tanks and platoons, can use evolutionary computation to adapt to the current and projected situations. In this article, we briefly review current knowledge in evolutionary algorithms and offer an example of applying these techniques to generate adaptive behavior in a platoon-level engagement of tanks in which the mission of one platoon is changed on-the-fly.

REFERENCES

• 1: Angeline, P. J. Subtree crossover: Building block engine or macromutation? In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, H. Iba, and R. L. Riolo, editors, Proceedings of the 2nd Annual Conference on Genetic Programming. Morgan Kaufmann, San Francisco, 1997, 9--17.
• 2: Thomas Bäck , Hans-Paul Schwefel, An overview of evolutionary algorithms for parameter optimization, Evolutionary Computation, v.1 n.1, p.1-23, Spring 1993
• 3: Thomas Back , David B. Fogel , Zbigniew Michalewicz, Handbook of Evolutionary Computation, IOP Publishing Ltd., Bristol, UK, 1997
• 4: Chellapilla, K. A preliminary investigation into evolving modular programs without subtree crossover. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. L. Riolo, editors, Proceedings of the 3rd Annual Genetic Programming Conference. Morgan Kaufmann, San Francisco, 1998, 23--31.
• 5: Darwin, C. On the Origin of Species by Means of Natural Selection or the Preservations of Favored Races in the Struggle for Life. John Murray, London, 1859.
• 6: Davis, L., editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.
• 7: Fogel, D. B. Asymptotic convergence properties of genetic algorithms and evolutionary programming. Cybernetics and Systems, 1994, 25(3):389--407.
• 8: David B. Fogel, Evolutionary Computation: The Fossil Record, Wiley-IEEE Press, 1998
• 9: Fogel, D. B. and Ghozeil, A. A note on representations and variation operators. IEEE Transactions on Evolutionary Computation, 1997, 1(2):159--161.
• 10: Fogel, D. B. and Stayton, L. C. On the effectiveness of crossover in simulated evolutionary optimization. BioSystems, 1994, 32(3):171--182.
• 11: Fuchs, M. Crossover versus mutation: An empirical and theoretical case study. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. L. Riolo, editors, Proceedings of the 3rd Annual Genetic Programming Conference. Morgan Kaufmann, San Francisco, 1998, 78--85.
• 12: David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
• 13: John H. Holland, Adaptation in natural and artificial systems, MIT Press, Cambridge, MA, 1992
• 14: Luke, S. and Spector, L. A revised comparison of crossover and mutation in genetic programming. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. L. Riolo, editors, Proceedings of the 3rd Annual Genetic Programming Conference. Morgan Kaufmann, San Francisco, 1998, 208--213.
• 15: Macready, W. G. and Wolpert, D. H. Bandit problems and the exploration/exploitation tradeoff. IEEE Transactions on Evolutionary Computation, 1998, 2(1), in press.
• 16: Zbigniew Michalewicz, Genetic algorithms + data structures = evolution programs (2nd, extended ed.), Springer-Verlag New York, Inc., New York, NY, 1994
• 17: V. William Porto , Lawrence J. Fogel, Evolution of Intelligently Interactive Behaviors for Simulated Forces, Proceedings of the 6th International Conference on Evolutionary Programming VI, p.419-430, April 13-16, 1997
• 18: Rudolph, G. Reflections on bandit problems and selection methods in uncertain environments. In T. Bäck, editor, Proceedings of the 7th International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, 1997, 166--173.