返回
Clustered Reinforcement Learning
DOI:10.1007/s11704-024-3194-1.png)
摘要
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
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
引用论文
Study of bi-directional buck-boost converter topologies for application in electrical vehicle motor drives应用于电动汽车电机驱动的双向buck-boost变换器拓扑研究
A multi-objective reinforcement learning algorithm for deadline constrained scientific workflow scheduling in clouds一种多目标强化学习算法,用于最后期限约束的云科学工作流调度
State-based episodic memory for multi-agent reinforcement learning基于状态的情景记忆的多智能体强化学习
MACHINE LEARNING
IF2.9
ICT for informal workers in Sub-Saharan Africa: Systematic review and analysis撒哈拉以南非洲非正规工人的信通技术: 系统回顾和分析

