An Exploration Method for Deep Reinforcement Learning Based on State Prioritized Replay

The exploration of environment is a vital foundation for deep reinforcement learning, and the exploration efficiency is directly related to the model training efficiency and interactive costs. In this paper, we propose an exploration method for deep reinforcement learning based on state prioritized replay, which realizes the automatic adjustment of the starting point of exploration. This paper analyzes the effect of the exploration algorithm on various algorithms and tasks, and verifies the effectiveness and robustness of the method in reducing the number of exploration steps and training time through multiple sets of hyperparameter experiments. Experiments show that compared with simple exploration, the method in this paper can reduce the number of exploration steps by 21.2% and 45.5%, respectively, and optimize the time indicators by 9.3% and 45.4% when applied to discrete tasks such as CartPole-v0. On continuous tasks such as Pendulum-v0, the number of exploration steps can be reduced by 41.9% and 8.3%, respectively, and the time indicators can be optimized by 40.7% and 10.1%.

Authors

Institutions

Publication Details

Published
2025-04-11
DOI
https://doi.org/10.1109/ainit65432.2025.11036041
Primary Topic
Advanced Decision-Making Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Exploration Method for Deep Reinforcement Learning Based on State Prioritized Replay

Y. H. Zhang, Zhenguo Wu, Cheng Peng
Advanced Decision-Making Techniques
article

An Exploration Method for Deep Reinforcement Learning Based on State Prioritized Replay

Y. H. Zhang, Zhenguo Wu, Cheng Peng
article en

Abstract

The exploration of environment is a vital foundation for deep reinforcement learning, and the exploration efficiency is directly related to the model training efficiency and interactive costs. In this paper, we propose an exploration method for deep reinforcement learning based on state prioritized replay, which realizes the automatic adjustment of the starting point of exploration. This paper analyzes the effect of the exploration algorithm on various algorithms and tasks, and verifies the effectiveness and robustness of the method in reducing the number of exploration steps and training time through multiple sets of hyperparameter experiments. Experiments show that compared with simple exploration, the method in this paper can reduce the number of exploration steps by 21.2% and 45.5%, respectively, and optimize the time indicators by 9.3% and 45.4% when applied to discrete tasks such as CartPole-v0. On continuous tasks such as Pendulum-v0, the number of exploration steps can be reduced by 41.9% and 8.3%, respectively, and the time indicators can be optimized by 40.7% and 10.1%.

China Resources (China) (CN)
Openalex Percentile: Top 79%
Advanced Decision-Making Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Exploration Method for Deep Reinforcement Learning Based on State Prioritized Replay — Y. H. Zhang, Zhenguo Wu, et al. · (2025) | TGRS Research Map | TGRS