期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Clustered Reinforcement Learning
1
作者 Xiao MA Shen-Yi ZHAO +1 位作者 Zhao-Heng YIN Wu-Jun LI 《Frontiers of Computer Science》 2025年第4期43-57,共15页
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 unexplor... 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. 展开更多
关键词 deep reinforcement learning EXPLORATION count-based method CLUSTERING K-MEANS
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部