A Novel HGW Optimizer with Enhanced Differential Perturbation for Efficient 3D UAV Path Planning

Lei Lv, Hongjuan Liu, Ruofei He, Weijia Jia, Wei SunDrones 2025 · DOI

TL;DR

This paper introduces a novel optimization algorithm, SDPGWO, designed to efficiently plan 3D flight paths for Unmanned Aerial Vehicles (UAVs). By simplifying the Gray Wolf Optimizer (GWO) and incorporating a differential perturbation strategy, SDPGWO significantly improves path quality, robustness, and convergence speed compared to existing methods, making it ideal for complex, real-world UAV missions.

What Problem Does This Paper Address?

Planning optimal flight paths for Unmanned Aerial Vehicles (UAVs) in three-dimensional (3D) environments is a critical but challenging task. These challenges stem from the complexity and uncertainty of flight scenarios, including navigating around obstacles, minimizing flight time and energy consumption, and ensuring mission success. Traditional path planning methods often struggle with these complexities, leading to inefficient routes, potential collisions, or getting stuck in suboptimal solutions. This paper aims to address these limitations by developing a more efficient and robust path planning algorithm specifically for 3D UAV operations.

Methods

The core of this paper is the development of a new optimization algorithm called the Simplified Differential Perturbation Gray Wolf Optimizer (SDPGWO). This algorithm builds upon the well-known Gray Wolf Optimizer (GWO), which mimics the social hierarchy and hunting behavior of gray wolves.

The SDPGWO introduces two key enhancements:

  1. Simplification Strategy: Instead of relying on the guidance of the top three wolves (alpha, beta, delta) as in standard GWO, the SDPGWO simplifies the update mechanism by having individual wolves update their positions based exclusively on the alpha wolf. This reduces computational complexity and streamlines the search process without sacrificing the algorithm's exploitation capabilities.
  2. Differential Perturbation Strategy: Inspired by the differential mutation process in Differential Evolution (DE), this strategy enhances the global search capability. It involves incorporating a scaled difference vector between two individuals into a third, creating a novel individual. This technique helps to increase population diversity and improve exploration, especially in the early stages of the search, thereby preventing the algorithm from getting trapped in local minima.

These two strategies are combined using a greedy selection mechanism. The algorithm first uses the simplification strategy to find an initial optimal position, then refines it using the differential perturbation strategy. This hybrid approach aims to balance exploration and exploitation effectively, leading to more robust and efficient optimization.

The paper also details the mathematical formulation for UAV path planning, including defining the objective function which considers path length cost, path altitude cost, and path threat cost. Path smoothing using cubic B-splines is also employed to ensure smooth and feasible trajectories.

Datasets

The paper does not introduce new datasets. Instead, it uses simulated environments, referred to as "Map 1" and "Map 2," to evaluate the performance of the proposed SDPGWO algorithm. These maps contain various obstacles (cylinders and cuboids) at specified locations and heights, representing typical challenges in 3D UAV path planning. The experiments were conducted using MATLAB R2022a.

Key Insights and Ideas

  • Simplifying metaheuristics can be effective: The paper demonstrates that by strategically simplifying the update rules of a metaheuristic algorithm (GWO), computational efficiency can be improved without significantly compromising its performance.
  • Differential perturbation is a powerful tool for global search: Borrowing concepts from DE, the differential perturbation strategy proves crucial in preventing premature convergence and enhancing the exploration of the solution space, leading to better global optima.
  • Hybridization is key to balancing exploration and exploitation: The combination of simplification (for exploitation) and differential perturbation (for exploration) in SDPGWO creates a synergistic effect, leading to superior performance across various metrics.
  • 3D path planning is significantly more complex: The comparison between Map 1 and Map 2 highlights how increased environmental complexity (more obstacles, denser search space) poses a greater challenge for all algorithms, underscoring the need for robust optimization techniques.

Key Results

The SDPGWO algorithm consistently outperformed other compared algorithms (GWO, PSO, DE, and SHOPSO) in both simulated environments (Map 1 and Map 2) across various metrics:

  • Path Quality: SDPGWO generated the shortest and smoothest paths, with lower objective function values (indicating better overall path cost). For instance, in Map 1 with n=12 waypoints, SDPGWO achieved an optimal fitness value of 7.3658 x 10², while others were higher. In Map 2, it achieved the lowest Optimal (553.6) and Mean (555.8) fitness values.
  • Convergence Speed: SDPGWO demonstrated rapid convergence, reaching optimal or near-optimal solutions much faster than other algorithms. In Map 1, it reached the global minimum within 40-60 iterations, significantly quicker than others.
  • Robustness and Reliability: SDPGWO showed superior stability, with minimal fluctuations in optimal values across multiple runs, as indicated by low standard deviations. It also achieved a high success rate (SR) of 100% in Map 1 and 98% in Map 2, meaning it reliably found feasible paths.
  • Runtime: While not always the fastest, SDPGWO's runtime was comparable to or only slightly longer than other algorithms, and the difference was deemed acceptable given its superior performance.

Limitations and Future Work

The authors acknowledge the following limitations and suggest future research directions:

  • Static Environments: The current study focused on static 3D environments. Real-world UAV applications often involve dynamic environments with uncertainties.
  • Multi-UAV Cooperative Path Planning: Extending the SDPGWO algorithm to handle multi-UAV cooperative path planning problems is a promising avenue.
  • Complex Task Environments: Future research should explore the application of SDPGWO in more challenging scenarios, such as larger-scale maps, denser obstacles, and stricter real-time requirements, potentially requiring more efficient optimization algorithms.

Summary updated

Abstract

In general, path planning for unmanned aerial vehicles (UAVs) is modeled as a challenging optimization problem that is critical to ensuring efficient UAV mission execution. The challenge lies in the complexity and uncertainty of flight scenarios, particularly in three-dimensional scenarios. In this study, one introduces a framework for UAV path planning in a 3D environment. To tackle this challenge, we develop an innovative hybrid gray wolf optimizer (GWO) algorithm, named SDPGWO. The proposed algorithm simplifies the position update mechanism of GWO and incorporates a differential perturbation strategy into the search process, enhancing the optimization ability and avoiding local minima. Simulations conducted in various scenarios reveal that the SDPGWO algorithm excels in rapidly generating superior-quality paths for UAVs. In addition, it demonstrates enhanced robustness in handling complex 3D environments and outperforms other related algorithms in both performance and reliability.
BibTeX
@inproceedings{lv2025novel,
  author = {Lei Lv and Hongjuan Liu and Ruofei He and Weijia Jia and Wei Sun},
  title = {{A Novel HGW Optimizer with Enhanced Differential Perturbation for Efficient 3D UAV Path Planning}},
  booktitle = {Drones},
  year = {2025},
  doi = {10.3390/drones9030212},
}
Figure