Hongyuan Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hongyuan Chen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Lieping Zhang
Guangxi Key Laboratory of Special Engineering Equipment and Control, Guilin University of Aerospace Technology, Guilin 541004, China
2 shared publications - Huaquan Gan
Education Department of Guangxi Zhuang Autonomous Region, Key Laboratory of Advanced Manufacturing and Automation Technology, Guilin University of Technology, Guilin, People’s Republic of China
1 shared publication - Jianchu Zou
Key Laboratory of AI and Information Processing, Education Department of Guangxi Zhuang Autonomous Region, Hechi University, Yizhou 546300, China
1 shared publication Lanqing Shao
School of Computer Science and Engineering, Guilin University of Aerospace Technology, Guilin, People’s Republic of China
1 shared publication- Shuilan Wang
School of Foreign Language and International Business, Guilin University of Aerospace Technology, Guilin, People’s Republic of China
1 shared publication - Xiaoxu Shi1 shared publication
Latest Publications
- 27 February 2026
- Published by IOP Publishing in Measurement Science and Technology
- Vol. 37 (8) , 086203
Path planning algorithm for mobile robots using value distribution and LSTM-based Soft Actor-Critic
To address unstable value estimation and insufficient use of temporal information by the soft Actor–Critic (SAC) algorithm in dynamic environments, we propose an improved SAC-based path-planning method that integrates distributional value learning and long short-term memory (LSTM). First, the critic models the return distribution via quantile regression to reduce the variance of value estimates and improve the stability of policy evaluation. Second, an LSTM encodes historical obstacle observations to enhance prediction of environmental dynamics and decision-making. Through comparative experiments in dynamic scenarios on the Gazebo simulation platform, the proposed method outperforms LSTM-enhanced DDPG, vanilla SAC, distributional SAC, and LSTM-SAC in average path length, average steps, and average planning time. Moreover, real-world experiments further verify the feasibility and robustness of the approach.
- 27 February 2026
- Published by IOP Publishing in Measurement Science and Technology
- Vol. 37 (8) , 086203
Path planning algorithm for mobile robots using value distribution and LSTM-based Soft Actor-Critic
To address unstable value estimation and insufficient use of temporal information by the soft Actor–Critic (SAC) algorithm in dynamic environments, we propose an improved SAC-based path-planning method that integrates distributional value learning and long short-term memory (LSTM). First, the critic models the return distribution via quantile regression to reduce the variance of value estimates and improve the stability of policy evaluation. Second, an LSTM encodes historical obstacle observations to enhance prediction of environmental dynamics and decision-making. Through comparative experiments in dynamic scenarios on the Gazebo simulation platform, the proposed method outperforms LSTM-enhanced DDPG, vanilla SAC, distributional SAC, and LSTM-SAC in average path length, average steps, and average planning time. Moreover, real-world experiments further verify the feasibility and robustness of the approach.
- Open Access
- 1 January 2024
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2024 (1)
Adaptive Improved Q‐Learning Path Planning Algorithm Based on Obstacle Learning Matrix and Artificial Potential Field
To address the issues of exploration imbalance and slow convergence speed in the Q‐learning path planning algorithm, an adaptive improved Q‐learning path planning algorithm based on an obstacle learning matrix and artificial potential field (APF) is proposed. First, an obstacle learning matrix is established to store the positions of obstacles encountered in each learning iteration, avoiding redundant learning of the same obstacle. Second, an adaptive exploration enhancement strategy is introduced by incorporating the concept of success rate. This strategy divides the decay process of the exploration rate into an exploration‐dominant initial stage and an exploitation‐dominant later stage. Finally, an APF‐weighted action selection strategy is introduced, utilizing the guiding force generated by the APF to encourage the mobile robot to avoid obstacles more efficiently. Simulation results show that the proposed method can effectively reduce the number of iterations and time consumption in the optimization process, resulting in a smoother and more stable planned path.
- 1 January 2024
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2024 (1)
Open AccessAdaptive Improved Q‐Learning Path Planning Algorithm Based on Obstacle Learning Matrix and Artificial Potential Field
To address the issues of exploration imbalance and slow convergence speed in the Q‐learning path planning algorithm, an adaptive improved Q‐learning path planning algorithm based on an obstacle learning matrix and artificial potential field (APF) is proposed. First, an obstacle learning matrix is established to store the positions of obstacles encountered in each learning iteration, avoiding redundant learning of the same obstacle. Second, an adaptive exploration enhancement strategy is introduced by incorporating the concept of success rate. This strategy divides the decay process of the exploration rate into an exploration‐dominant initial stage and an exploitation‐dominant later stage. Finally, an APF‐weighted action selection strategy is introduced, utilizing the guiding force generated by the APF to encourage the mobile robot to avoid obstacles more efficiently. Simulation results show that the proposed method can effectively reduce the number of iterations and time consumption in the optimization process, resulting in a smoother and more stable planned path.