TY - GEN
T1 - Enhancing Curiosity-driven Reinforcement Learning through Historical State Information for Long-term Exploration
AU - Wang, Jian
AU - Liu, Bo
AU - Chen, Jing
AU - Lei, Ting
AU - Ni, Ke
N1 - Publisher Copyright:
© 2023 ACM.
PY - 2023/12/22
Y1 - 2023/12/22
N2 - Curiosity-driven reinforcement learning is proposed to solve the sparse extrinsic reward problem by providing intrinsic rewards and achieves promising results. However, most curiosity algorithms do not acquire sufficient states knowledge and can only process local information, which would suffer from long time horizon exploration problem. In this paper, we propose a curiosity-driven exploration strategy that can continuously incentivize the curiosity of agents to address long-term exploration. In particular, we introduce a consistent exploration that provides agents with moderate knowledge, i.e., a certain amount of historical information by maintaining a finite-length state feature pool to stimulate agent's curiosity, and gives agents a novel direction of exploration. To balance the consistency and diversity of exploration directions, we propose a high-freedom exploration module that allows agents to acquire important items, such as keys to open doors, by adding actions to RND. We compared the proposed method with some recent advanced algorithms in partial Atari 2600 games environments. Experimental results demonstrate the superior performance of our method in sparse environments, especially in exploratory task with a 50% improvement in score compared to the baseline algorithm RND.
AB - Curiosity-driven reinforcement learning is proposed to solve the sparse extrinsic reward problem by providing intrinsic rewards and achieves promising results. However, most curiosity algorithms do not acquire sufficient states knowledge and can only process local information, which would suffer from long time horizon exploration problem. In this paper, we propose a curiosity-driven exploration strategy that can continuously incentivize the curiosity of agents to address long-term exploration. In particular, we introduce a consistent exploration that provides agents with moderate knowledge, i.e., a certain amount of historical information by maintaining a finite-length state feature pool to stimulate agent's curiosity, and gives agents a novel direction of exploration. To balance the consistency and diversity of exploration directions, we propose a high-freedom exploration module that allows agents to acquire important items, such as keys to open doors, by adding actions to RND. We compared the proposed method with some recent advanced algorithms in partial Atari 2600 games environments. Experimental results demonstrate the superior performance of our method in sparse environments, especially in exploratory task with a 50% improvement in score compared to the baseline algorithm RND.
KW - Curiosity-driven exploration
KW - Deep learning
KW - Information-gap theory
KW - Reinforcement learning
UR - https://www.scopus.com/pages/publications/85195423346
U2 - 10.1145/3660043.3660202
DO - 10.1145/3660043.3660202
M3 - Conference contribution
AN - SCOPUS:85195423346
T3 - ACM International Conference Proceeding Series
SP - 897
EP - 902
BT - Proceedings of the 2023 International Conference on Information Education and Artificial Intelligence, ICIEAI 2023
PB - Association for Computing Machinery
T2 - 2023 International Conference on Information Education and Artificial Intelligence, ICIEAI 2023
Y2 - 22 December 2023 through 24 December 2023
ER -