A proximal policy optimization algorithm based on adaptive hierarchical particle swarm
This paper proposes an adaptive hierarchical particle swarm optimization enhanced proximal policy optimization (AHPSO-PPO) framework. This framework addresses key challenges in reinforcement learning (RL), particularly slow convergence and premature convergence to sub-optimal policies. Firstly, adaptive parameter tuning, hierarchical particle swarm optimization, and variational evolution strategies are introduced in AHPSO. Secondly, the network parameters in RL are used as the optimization objective of the intelligent algorithm to obtain the optimal parameters faster and better. Finally, the experimental verification in a simulation environment shows that the AHPSO-PPO algorithm proposed in this paper performs better than standard PPO and DDPG. It has a faster convergence speed and a certain degree of robustness to environmental randomness. This hybrid approach links gradient-based optimization with group intelligence, providing a scalable solution for real-world decision-making systems.
Authors
- Chengcheng Ren (ORCID: https://orcid.org/0000-0002-0785-9729)
- Shuping He (ORCID: https://orcid.org/0000-0003-1869-2116)
- Jianfei Wei (ORCID: https://orcid.org/0000-0001-5886-3261)
- Guangyu Wang (ORCID: https://orcid.org/0000-0003-1312-884X)
- Longlong Wang (ORCID: https://orcid.org/0000-0001-5279-1885)
- Liang Zhang (ORCID: https://orcid.org/0009-0003-4785-3801)
- Guoqing Xie
Institutions
- Ministry of Education (BD)
Publication Details
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1109/ddcls66240.2025.11065850
- Primary Topic
- Advanced Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Research and Development