Effect of Parameters of Genetic Algorithm on Results in Action Games
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, it was intended to identify effect of parameter values of genetic algorithm on results. As the study subject, an action game with 10 actions was used. In the action game, intelligent characters were set to find optimal solutions by evolving by themselves along with repetition of generations. Among several parameters of the genetic algorithm, population size, cross rate, and mutation rate were changed and applied. The range of population size was set to be from 50 to 950, and the cross rate and the mutation rate were applied, changing from 0.7% to 1.0% and from 0.005% to 0.24% respectively. As the results, it was achieved to find optimal solution after 90 generations. It was found that the combination of parameters to identify optimal solution within the most rapid time were 300 in population size, 1 in cross rate, and 0.01 in mutation rate. Because this combination of parameters cannot be found with some trials, there are some difficulties that a number of repeated experiments with various combinations of parameters are required
Abstract
In this paper, it was intended to identify effect of parameter values of genetic algorithm on results. As the study subject, an action game with 10 actions was used. In the action game, intelligent characters were set to find optimal solutions by evolving by themselves along with repetition of generations. Among several parameters of the genetic algorithm, population size, cross rate, and mutation rate were changed and applied. The range of population size was set to be from 50 to 950, and the cross rate and the mutation rate were applied, changing from 0.7% to 1.0% and from 0.005% to 0.24% respectively. As the results, it was achieved to find optimal solution after 90 generations. It was found that the combination of parameters to identify optimal solution within the most rapid time were 300 in population size, 1 in cross rate, and 0.01 in mutation rate. Because this combination of parameters cannot be found with some trials, there are some difficulties that a number of repeated experiments with various combinations of parameters are required
참고문헌 (11)
- Adalberto Ramirez Muz, "Handbook of genetic algorithma : New research" (2012), Nova
- Rick Riolo, "Genetic programming theory and practice VI", Genetic and Evolutionary Computation, 6 (2008)
- Vose, "The simple genetic algorithm" (2007), Mit Press
- Penelope Sweetser, "A model for evaluating player enjoyment in games", Game Developers Conference (2004)
- Tho, Dang Xuan, "Genetic algorithms and application in examination scheduling" (2013), Grin Verlag
- Zhang G, "An effective genetic algorithm for the flexible job-shop scheduling problem", Expert Syst Appl, ~ (2011)
- Goldberg, "Genetic algorithm in search, optimization and machine learning" (1989), Addison-Wesley Publishing Co.Inc.
- Goldberg, David, "The design of innovation:lessons from and for competent genetic algorithms" (2002), Kluwer Academic Publishers
- Juul. J, "Working with the Player's Repertoire", International Jounal on Intellgent Games and Simulation, pp.54~61 (2004)
- W. Sterren, "Tactical Path-Finding with GA, in Game Programming Gem 3", pp.294~306 (2002), Charles River Media
- Myunsub Lee, "Intelligent characters for fighting action games using genetic algorithm", pp.2005