OAK

Genetic state-grouping algorithm for deep reinforcement learning

Metadata Downloads
Abstract
Although Reinforcement learning has already been considered one of the most important and well-known techniques of machine learning, its applicability remains limited in the real-world problems due to its long initial learning time and unstable learning. Especially, the problem of an overwhelming number of the branching factors under real-time constraint still stays unconquered, demanding a new method for the next generation of reinforcement learning. In this paper, we propose Genetic State-Grouping Algorithm based on deep reinforcement learning. The core idea is to divide the entire set of states into a few state groups. Each group consists of states that are mutually similar, thus representing their common features. The state groups are then processed with the Genetic Optimizer, which finds outstanding actions. These steps help the Deep Q Network avoid excessive exploration, thereby contributing to the significant reduction of initial learning time. The experiment on the real-time fighting video game (FightingICE) shows the effectiveness of our proposed approach. (c) 2020 Elsevier Ltd. All rights reserved.
Author(s)
Kim, Man-JeKim, Jun SukKim, Sungjin JamesKim, Min-jungAhn, Chang Wook
Issued Date
2020-12
Type
Article
DOI
10.1016/j.eswa.2020.113695
URI
https://scholar.gist.ac.kr/handle/local/11840
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Citation
EXPERT SYSTEMS WITH APPLICATIONS, v.161
ISSN
0957-4174
Appears in Collections:
Department of AI Convergence > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.