You are here

Comparison of Evolution Strategy, Genetic Algorithm and Their Hybrids on Evolving Autonomous Game Controller Agents

Journal Name:

Publication Year:

Abstract (2. Language): 
Researchers have been applying artificial/computa-tional intelligence (AI/CI) methods to computer games. In this research field, further researches are required to compare AI/CI methods with respect to each game application. In this paper, we report our experimental results on the comparison of two evolutionary algorithms (evolution strategy and genetic algorithm) and their hybrids, applied to evolving autonomous game controller agents. The games are the CIG2007 simulated car racing and the MarioAI 2009. In the application to the simulated car racing, premature convergence of solutions was observed in the case of ES, and GA outperformed ES in the last half of generations. Besides, a hybrid which uses GA first and ES next evolved the best solution among the whole solutions being generated. This result shows the ability of GA in globally searching promising areas in the early stage and the ability of ES in locally searching the focused area (fine-tuning solutions). On the contrary, in the application to the MarioAI, GA revealed its advantage in our experiment, whereas the expected ability of ES in exploiting (fine-tuning) solutions was not clearly observed. The blend crossover operator and the mutation operator of GA might contribute well to explore the vast search space.
11-16

REFERENCES

References: 

[1] H.-P. Schwefel, Evolution and Optimum Seeking. New York: Wiley &
Sons, 1995.
[2] D. E. Goldberg, Genetic Algorithms in Search Optimization and
Machine Learning. Addison Wesley, 1989.
[3] X. Yao, “A review of evolutionary artificial neural networks,”
International Journal of Intelligent Systems, vol.4, pp.539–567, 1993.
[4] K.O. Stanley and R. Miikkulainen, “Evolving neural networks through
augmenting topologies,” Evolutionary Computation, vol.10, no.2,
pp.99–127, 2002.
[5] S. Lucas, and J. Togelius, “Point-to-point car racing: an initial study of
evolution versus temporal difference learning,” Proc. of IEEE
Conference on Computational Intelligence and Games (CIG) 2007,
pp.260–267, 2007. http://cswww.essex.ac.uk/cig/2007/papers/2071.pdf
[6] L.J. Eshelman, “Real-coded genetic algorithms and interval-schemata,”
Foundations of Genetic Algorithms 2, pp.187–202, 1993.
[7] Y.S. Ong, M.H. Lim, N. Zhu and K.W. Wong, “Classification of
adaptive memetic algorithms: a comparative study,” IEEE Transactions
on Systems Man and Cybernetics - Part B, vol.36, no.1, pp.141–152,
2006.
[8] J.E. Smith, “Coevolving memetic algorithms: a review and progress
report,” IEEE Transactions on Systems Man and Cybernetics - Part B,
vol.37, no.1, pp.6–17, 2007.
[9] F. Neri, C. Cotta, and P. Moscato (eds), Handbook of Memetic
Algorithms. Springer, 2011.

Thank you for copying data from http://www.arastirmax.com