심층 큐 신경망을 이용한 게임 에이전트 구현
Deep Q-Network based Game Agents
2
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
The video game Tetris is one of most popular game and it is well known that its game rule can be modelled as MDP (Markov Decision Process). This paper presents a DQN (Deep Q-Network) based game agent for Tetris game. To this end, the state is defined as the captured image of the Tetris game board and the reward is designed as a function of cleared lines by the game agent. The action is defined as left, right, rotate, drop, and their finite number of combinations. In addition to this, PER (Prioritized Experience Replay) is employed in order to enhance learning performance. To train the network more than 500000 episodes are used. The game agent employs the trained network to make a decision. The performance of the developed algorithm is validated via not only simulation but also real Tetris robot agent which is made of a camera, two Arduinos, 4 servo motors, and artificial fingers by 3D printing.
Abstract
The video game Tetris is one of most popular game and it is well known that its game rule can be modelled as MDP (Markov Decision Process). This paper presents a DQN (Deep Q-Network) based game agent for Tetris game. To this end, the state is defined as the captured image of the Tetris game board and the reward is designed as a function of cleared lines by the game agent. The action is defined as left, right, rotate, drop, and their finite number of combinations. In addition to this, PER (Prioritized Experience Replay) is employed in order to enhance learning performance. To train the network more than 500000 episodes are used. The game agent employs the trained network to make a decision. The performance of the developed algorithm is validated via not only simulation but also real Tetris robot agent which is made of a camera, two Arduinos, 4 servo motors, and artificial fingers by 3D printing.
참고문헌 (9)
- V. Mnih, "Human-level control through deep reinforcement learning", Nature, 518(7540), pp.529~533 (2015)
- E. Demaine, "Tetris is hard, even to approximate", Proceedings of the Ninth International Computing and Combinatorics Conference, pp.351~363 (2003)
- I. Szita, "Learning Tetris using the noisy crossentropy method", Neural Computation, 18(12), pp.2936~2941 (2006)
- V. Gabillon, "Approximate dynamic programming finally performs well in the game of Tetris", Advances in Neural Information Processing Systems, pp.1754~1762 (2013)
- C. J. C. H. Watkins, "Technical note Q-learning", Journal of Machine Learning, 8, pp.279~292 (1992)
- T. Mitchell, "Machine Learning" (1997), McGraw Hill
- H. van Hasselt, "Deep reinforcement learning with double Q-learning", Proceedings of the Association for the Advancement of Artificial Intelligence, pp.2094~2100 (2016)
- T. Schaul, "Prioritized experience replay", Proceedings of the International Conference on Learning Representations (2016)
- Z. Wang, "Dueling network architectures for deep reinforcement learning", Proceedings of the International conference on Machine Learning, 48, pp.1995~2003 (2016)