Heuristic-enhanced Proximal Policy Optimization Algorithm for Navigation
The challenge of navigating unmanned aerial vehicles (UAVs) can be effectively tackled through the application of reinforcement learning (RL) methodologies. Nonetheless, the baseline Proximal Policy Optimization (PPO) algorithm faces significant hurdles in achieving efficient convergence, primarily due to the sparse nature of rewards associated with navigation tasks. Addressing this issue, this paper presents an enhanced approach by integrating heuristic exploration strategies into the PPO framework, leading to the development of the AS-PPO (Action Switching PPO) algorithm. Furthermore, the research introduces specifically tailored reward functions designed for navigation purposes. Empirical evidence from experimental outcomes confirms the viability and efficacy of the proposed ASPPO method, highlighting its superior performance in handling continuous action spaces within navigation tasks.
Authors
- Haikuo Liu (ORCID: https://orcid.org/0000-0002-0458-722X)
- Yanmin Liu (ORCID: https://orcid.org/0000-0002-1571-5370)
- Yuhang Zhang (ORCID: https://orcid.org/0009-0007-3725-2243)
- Yidian Huang (ORCID: https://orcid.org/0009-0006-8267-6590)
Institutions
- Beijing Institute of Technology (CN)
Publication Details
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/icaisisas64483.2025.11051844
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00