arrow
返回

Clustered Reinforcement Learning

delete2024-11-22
delete0
PRE
AI
X
Xiao Ma
Z
Zhao-Heng Yin
W
Wu-Jun Li *
DOI:10.1007/s11704-024-3194-1delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Exploration strategy design is a challenging problem in reinforcement learning (RL), especially when the environment contains a large state space or sparse rewards. During exploration, the agent tries to discover unexplored (novel) areas or high reward (quality) areas. Most existing methods perform exploration by only utilizing the novelty of states. The novelty and quality in the neighboring area of the current state have not been well utilized to simultaneously guide the agent's exploration. To address this problem, this paper proposes a novel RL framework, called clustered reinforcement learning (CRL), for efficient exploration in RL. CRL adopts clustering to divide the collected states into several clusters, based on which a bonus reward reflecting both novelty and quality in the neighboring area (cluster) of the current state is given to the agent. CRL leverages these bonus rewards to guide the agent to perform efficient exploration. Moreover, CRL can be combined with existing exploration strategies to improve their performance, as the bonus rewards employed by these existing exploration strategies solely capture the novelty of states. Experiments on four continuous control tasks and six hard-exploration Atari-2600 games show that our method can outperform other state-of-the-art methods to achieve the best performance.
Keyword:
deep reinforcement learning
exploration
count-based method
clustering
K-means

期刊

Frontiers of Computer Science 封面图
Frontiers of Computer Science
IF:
4.6
论文数:
1.6K
被引数:
2.8K

机构

N
nanjing university
学者数:
7.8W
论文数: 5.6W
被引数: 87
University of California System 封面图
University of California System
学者数:
37.7W
论文数: 33.8W
被引数: 6.6K
引用论文

引用论文

err分享
err收藏
err分享
err收藏
学者 查看更多内容