Oct 2026· Transactions of the Institute of Measurement and Control· 0 citations· 36 references
Abstract
This study proposes an unmanned aerial vehicle path-planning framework that integrates improved Rapidly-exploring Random Tree Star (improved RRT*) and Q-learning algorithms (Improved Rapidly-exploring Random Tree Star (IRRT*)-IQL) to address challenges such as low path-planning efficiency and susceptibility to local optima in complex environments, while also mitigating inter-unmanned aerial vehicle conflicts and enabling efficient multi-unmanned aerial vehicle cooperation. First, the RRT* algorithm is enhanced through the introduction of dynamic step size, dynamic neighborhood search radius, and goal-biased sampling strategies, which significantly improve its environmental exploration efficiency. Second, the resultant path point information is transferred to initialize the Q-table, providing the improved IQL algorithm with high-value state-action estimates. On this basis, the Q-learning algorithm is further enhanced with a dynamic learning rate, dynamic exploration rate, multiple reward functions, and an enhanced ε-greedy strategy to boost its path optimization capability. The planned path is smoothed using Bezier curves to generate a safe and smooth trajectory. Finally, path-planning experiments conducted in diverse static complex environments and varying numbers of unmanned aerial vehicles in dynamic complex scenarios show that the proposed algorithm effectively blends the rapid search capability and the autonomous learning ability, demonstrating competitive path quality together with improved convergence efficiency and effective multi-unmanned aerial vehicle coordination in the evaluated scenarios.
UAV path planning is a crucial component of autonomous navigation and logistics delivery, and its performance directly affects both operational safety and efficiency. However, the standard A* algorithm often suffers from redundant node expansions and limited path smoothness in cluttered environments, which constrains r...
Duo Ding, Da-Long Liu· Journal of Physics, Conferen...· 0 citations
The Personal History Memory Mechanism is introduced, which replaces random perturbation with weighted historical experience to enhance the directional search capability of the algorithm, and a greedy selection strategy is embedded to ensure the monotonically non-deteriorating quality of population solutions.
In response to the challenges of high-risk close-proximity flight and 3D path planning for unmanned aerial vehicles in mountainous power line inspection scenarios characterized by complex terrain and densely distributed power lines and trees, this paper proposes a risk-aware rapidly-exploring random tree (RRT)* algorit...
Jian Cao, Shun-Jie Han, Xing-Guang Cheng et al.· Engineering Research Express· 0 citations
A Dynamic Hybrid Multi-strategy RRT (DHM-RRT*) algorithm, which provides clear advantages in convergence speed, path length, smoothness and environmental robustness under complex obstacle constraints.
Compared to the traditional Q-Learning algorithm, the improved algorithm significantly reduces the number of episodes required to find the optimal path, produces smoother paths closer to the optimal solution, and achieves substantial improvements in convergence speed, exploration efficiency, and path planning quality.
Man Chang, Zheng Wang, Xin-Yu Qu et al.· International Conference on...· 0 citations
Unmanned Aerial Vehicles (UAVs) are revolutionizing power grid inspection, yet ensuring reliable, high-quality image transmission in complex environments remains a significant challenge for autonomous operations. Traditional path planning algorithms often neglect communication constraints, risking mission failure in ar...
Shen-Yu Wang, Xing-Yuan Wang, Yong-Dong Dai et al.· Drones· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.