OAK

Evolving population method for real-time reinforcement learning

Metadata Downloads
Abstract
Reinforcement learning has recently been recognized as a promising means of machine learning, but its applicability remains limited in real-time environment due to its short response time, high computational complexity, and instability in learning. Although researchers devised several measures in attempts to press beyond the horizon, the problems consisting of large branching factors with real-time properties still stays unconquered, demanding a new method for reinforcement learning as a whole. In this paper, we propose Evolving Population. This method improves the performance of reinforcement learning by optimizing hyperparameters and available actions. This method uses an iterative structure based on an evolutionary strategy to optimize these elements. We validate the performance of our method in an environment with real-time properties and large branching factors. © 2023 Elsevier Ltd
Author(s)
Kim, Man-JeKim, Jun SukAhn, Chang Wook
Issued Date
2023-11
Type
Article
DOI
10.1016/j.eswa.2023.120493
URI
https://scholar.gist.ac.kr/handle/local/9911
Publisher
Elsevier Ltd
Citation
Expert Systems with Applications, v.229
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.