RRT*-DLPSO is proposed as an effective offline spatial reference-path planner for known static mountainous terrain represented by DEM data and shows statistically significant improvements over all major competing methods.
Abstract
Low-altitude unmanned aerial vehicles operating in mountainous environments require continuous spatial reference paths that satisfy terrain-clearance, altitude, pitch, and curvature constraints. Conventional sampling-based planners can efficiently discover collision-free paths but often produce geometrically irregular solutions, whereas swarm-based optimizers are sensitive to the quality and feasibility of their initial populations. This study proposes a feasibility-first hybrid reference-path planner, termed RRT*-DLPSO, which combines Rapidly Exploring Random Tree Star initialization with a particle swarm optimizer incorporating Differential Evolution and Lévy-flight mechanisms. RRT* first supplies a terrain-aware initial polyline, which is compressed into curvature-selected control points and represented by a cubic spline. Because compression and interpolation can invalidate a collision-free polyline, every reconstructed path is checked using the full set of hard constraints. DLPSO then refines the path using time-varying learning factors, stage-adaptive differential trial generation, and stagnation-triggered Lévy perturbations. Feasible paths are ranked using a weighted objective that considers path length, altitude, pitch demand, and horizontal curvature. Experiments were conducted in three DEM-based mountainous scenarios using 50 independent runs per method. The comparison includes a complete RRT*-PSO ablation chain and an RRT*-STOMP baseline. RRT*-DLPSO achieved a 100% continuously certified feasibility rate and the lowest mean final objective value in all three scenarios with respect to the adopted spline and interpolated DEM model. Relative to the strongest competing method in each scenario, it reduced the mean objective by 6.4%, 5.1%, and 3.9%, respectively. Compared with DLPSO without RRT* initialization, the corresponding reductions were 13.0%, 19.6%, and 32.9%. Paired Wilcoxon tests with Holm correction confirmed statistically significant improvements over all major competing methods. The method also reached the scenario-specific objective thresholds in 86%, 100%, and 96% of the runs. Sensitivity analyses repeated in two DEM scenarios supported nine control points and an RRT* step-size and rewiring-radius coefficient pair of (0.020, 0.040) among the tested settings. These results support RRT*-DLPSO as an effective offline spatial reference-path planner for known static mountainous terrain represented by DEM data.
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.
This paper develops a hybrid path-planning method, rapidly-exploring random tree star (RRT*)-deep Q-network (DQN), which combines the fast global search capability of RRT* with the deep learning-based heuristic prediction of a DQN.
Abhishek Bajpai, Abhinav, N. Tiwari· Engineering Research Express· 0 citations
This study presents a supervisory multi-objective geometric path-planning framework for fixed-wing UAV navigation in complex three-dimensional terrain. The path is represented by three-dimensional waypoints, which constitute the optimization variables. For each candidate path generated by the BTT-enhanced Butterfly O...
Hakimeh Mazaheri, Salman Goli, Ali Nourollah· Scientific Reports· 0 citations
A hierarchical “Search-and-Smooth” framework comprising an Enhanced Weighted A algorithm whose edge-cost function directly encodes all three objectives—path length, turning cost, and spatial risk — and a greedy Line-of-Sight post-processor that removes residual grid-discretization artifacts is proposed.
Tan Lei, Shi-Ming Liu, Yong-Tao Lei· Frontiers in Robotics and AI· 0 citations
The results support RA-ALA as a simulation-tested route-generation framework under the modeled constraints, without establishing isolated-operator superiority or real-flight readiness.
Kai-Jun Xu, Yi-Lin Hong, Hong-Da Luo 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.