Abstract
In post-disaster search and rescue scenarios, robotic path planning must operate in unpredictable, dynamic environments where conventional coverage path planning (CPP) algorithms often struggle to adapt. To address this challenge, we propose an intelligent path planning algorithm called PERM-QN (Q-learning with priority experience replay and memory network), designed for energy-aware, complete area coverage in uncertain terrains. PERM-QN integrates a dynamic weight reward function, priority experience replay, and a memory network to enable efficient, comprehensive exploration in complex, obstacle-laden environments. The dynamic weight reward function adaptively balances coverage, path length, and energy consumption across different phases of operation, and the priority experience replay mechanism accelerates learning convergence by focusing on high-value past experiences. Finally, the memory network expedites route planning in regions with similar terrain, reducing redundant exploration. Experiments in simulated post-disaster environments of varying complexity demonstrate that PERM-QN achieves more efficient and comprehensive exploration than traditional methods while maintaining robust performance. These findings highlight PERM-QN as an effective path planning solution for robotic search in complex, dynamic environments.
| Original language | English |
|---|---|
| Article number | 44724 |
| Number of pages | 18 |
| Journal | Scientific Reports |
| Volume | 15 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 29 Dec 2025 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Keywords
- Complex and unknown environments
- Energy Expenditure
- Full coverage path planning
- Reinforcement learning
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver