TY - GEN
T1 - Analysis of vanilla rolling Horizon evolution parameters in general video game playing
AU - GAINA, Raluca D.
AU - LIU, Jialin
AU - LUCAS, Simon M.
AU - PÉREZ-LIÉBANA, Diego
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - Monte Carlo Tree Search techniques have generally dominated General Video Game Playing, but recent research has started looking at Evolutionary Algorithms and their potential at matching Tree Search level of play or even outperforming these methods. Online or Rolling Horizon Evolution is one of the options available to evolve sequences of actions for planning in General Video Game Playing, but no research has been done up to date that explores the capabilities of the vanilla version of this algorithm in multiple games. This study aims to critically analyse the different configurations regarding population size and individual length in a set of 20 games from the General Video Game AI corpus. Distinctions are made between deterministic and stochastic games, and the implications of using superior time budgets are studied. Results show that there is scope for the use of these techniques, which in some configurations outperform Monte Carlo Tree Search, and also suggest that further research in these methods could boost their performance.
AB - Monte Carlo Tree Search techniques have generally dominated General Video Game Playing, but recent research has started looking at Evolutionary Algorithms and their potential at matching Tree Search level of play or even outperforming these methods. Online or Rolling Horizon Evolution is one of the options available to evolve sequences of actions for planning in General Video Game Playing, but no research has been done up to date that explores the capabilities of the vanilla version of this algorithm in multiple games. This study aims to critically analyse the different configurations regarding population size and individual length in a set of 20 games from the General Video Game AI corpus. Distinctions are made between deterministic and stochastic games, and the implications of using superior time budgets are studied. Results show that there is scope for the use of these techniques, which in some configurations outperform Monte Carlo Tree Search, and also suggest that further research in these methods could boost their performance.
KW - Games
KW - General video game playing
KW - Monte Carlo Tree search
KW - Random search
KW - Rolling Horizon evolution
UR - http://www.scopus.com/inward/record.url?scp=85017540506&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-55849-3_28
DO - 10.1007/978-3-319-55849-3_28
M3 - Conference paper (refereed)
AN - SCOPUS:85017540506
SN - 9783319558486
T3 - Lecture Notes in Computer Science
SP - 418
EP - 434
BT - Applications of Evolutionary Computation : 20th European Conference, EvoApplications 2017, Proceedings, Part I
A2 - SQUILLERO, Giovanni
A2 - SIM, Kevin
A2 - ASCHEID, Gerd
A2 - BACARDIT, Jaume
A2 - BRABAZON, Anthony
A2 - BURRELLI, Paolo
A2 - CAGNONI, Stefano
A2 - COTTA, Carlos
A2 - D’ANDREAGIOVANNI, Fabio
A2 - DIVINA, Federico
A2 - ESPARCIA-ALCÁZAR, Anna I.
A2 - FERNÁNDEZ DE VEGA, Francisco
A2 - GLETTE, Kyrre
A2 - HAASDIJK, Evert
A2 - HEINERMAN, Jacqueline
A2 - HIDALGO, J. Ignacio
A2 - HU, Ting
A2 - IACCA, Giovanni
A2 - KAMPOURIDIS, Michael
A2 - KAUFMANN, Paul
A2 - MAVROVOUNIOTIS, Michalis
A2 - MORA GARCÍA , Antonio M.
A2 - NGUYEN, Trung Thanh
A2 - SCHAEFER, Robert
A2 - SILVA, Sara
A2 - TARANTINO, Ernesto
A2 - TONDA, Alberto
A2 - URQUHART, Neil
A2 - ZHANG, Mengjie
PB - Springer-Verlag Italia Srl
T2 - 20th European Conference on the Applications of Evolutionary Computation, EvoApplications 2017
Y2 - 19 April 2017 through 21 April 2017
ER -