paper-with-me

Papers

Enhanced Rolling Horizon Evolution Algorithm with Opponent Model Learning: Results for the Fighting Game AI Competition

2020-03-31 · Zhentao Tang, Yuanheng Zhu, Dongbin Zhao, Simon M. Lucas

The Fighting Game AI Competition (FTGAIC) provides a challenging benchmark for 2-player video game AI. The challenge arises from the large action space, diverse styles of characters and abilities, and the real-time nature of the game. In this paper, we propose a novel algorithm that combines Rolling Horizon Evolution Algorithm (RHEA) with opponent model learning. The approach is readily applicable to any 2-player video game. In contrast to conventional RHEA, an opponent model is proposed and is optimized by supervised learning with cross-entropy and reinforcement learning with policy gradient and Q-learning respectively, based on history observations from opponent. The model is learned during the live gameplay. With the learned opponent model, the extended RHEA is able to make more realistic plans based on what the opponent is likely to do. This tends to lead to better results. We compared our approach directly with the bots from the FTGAIC 2018 competition, and found our method to significantly outperform all of them, for all three character. Furthermore, our proposed bot with the policy-gradient-based opponent model is the only one without using Monte-Carlo Tree Search (MCTS) among top five bots in the 2019 competition in which it achieved second place, while using much less domain knowledge than the winner.

📄 PDF Abstract BibTeX arXiv:2003.13949

Code (0)

등록된 구현이 없습니다.

Tasks

Q-LearningReinforcement Learning

Methods 이 논문이 사용한 방법론

Monte-Carlo Tree Search Monte-Carlo Tree Search is a planning algorithm that accumulates value estimates obtained from Monte Carlo simulations in order to successively direct simulations towards more…
Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…

Similar Papers 제목 키워드 기반

Does it matter how well I know what you're thinking? Opponent Modelling in an RTS game

2020-06-15 · James Goodman, Simon Lucas

Opponent Modelling tries to predict the future actions of opponents, and is required to perform well in multi-player games. There is a deep literature on learning an opponent model, but much less on how accurate such mod…

Developing a Successful Bomberman Agent

2022-03-17 · Dominik Kowalczyk, Jakub Kowalski, Hubert Obrzut, Michał Maras 외

In this paper, we study AI approaches to successfully play a 2-4 players, full information, Bomberman variant published on the CodinGame platform. We compare the behavior of three search algorithms: Monte Carlo Tree Sear…

Position

Rolling Horizon NEAT for General Video Game Playing

2020-05-14 · Diego Perez-Liebana, Muhammad Sajid Alam, Raluca D. Gaina

This paper presents a new Statistical Forward Planning (SFP) method, Rolling Horizon NeuroEvolution of Augmenting Topologies (rhNEAT). Unlike traditional Rolling Horizon Evolution, where an evolutionary algorithm is in c…

Population Seeding Techniques for Rolling Horizon Evolution in General Video Game Playing

2017-04-23 · Rauca D. Gaina, Simon M. Lucas, Diego Perez-Liebana

While Monte Carlo Tree Search and closely related methods have dominated General Video Game Playing, recent research has demonstrated the promise of Rolling Horizon Evolutionary Algorithms as an interesting alternative. …

Evolutionary Algorithms

Rolling Horizon Evolutionary Algorithms for General Video Game Playing

2020-03-27 · Raluca D. Gaina, Sam Devlin, Simon M. Lucas, Diego Perez-Liebana

Game-playing Evolutionary Algorithms, specifically Rolling Horizon Evolutionary Algorithms, have recently managed to beat the state of the art in win rate across many video games. However, the best results in a game are …

Evolutionary Algorithms