EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Three‐Dimensional Path Planning for Unmanned Aerial Vehicle Based on Multi‐Strategy Improved Dung Beetle Optimisation Algorithm

Hengqing Lin, Linghua Wang

Electronics Letters · 2026-01 · 62 (1)

DOI: 10.1049/ell2.70616 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Electronics Letters, online erschienen am 19.05.2026. Verfasst von Hengqing Lin und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A multi‐strategy improved dung beetle optimiser (MSDBO) is proposed for unmanned aerial vehicle (UAV) 3D path planning, aiming to solve the limitations of traditional algorithms (A*, Dijkstra's) in dynamic and multi‐constraint 3D spaces. The MSDBO optimises the original dung beetle optimiser (DBO) by three strategies: Fuch map initialisation for better population diversity, opposition‐based learning for faster convergence, and adaptive inertia weight for balancing global exploration and local exploitation. These improvements effectively enhance the algorithm's convergence speed, solution quality, and anti‐local optimum ability. MATLAB simulation experiments show that MSDBO outperforms other mainstream optimisation algorithms in fitness value and path length for UAV 3D path planning.

Zitieren

APA

Lin, H., & Wang, L. (2026). Three‐Dimensional Path Planning for Unmanned Aerial Vehicle Based on Multi‐Strategy Improved Dung Beetle Optimisation Algorithm. Electronics Letters, 62(1). https://doi.org/10.1049/ell2.70616

Vancouver

Lin H, Wang L. Three‐Dimensional Path Planning for Unmanned Aerial Vehicle Based on Multi‐Strategy Improved Dung Beetle Optimisation Algorithm. Electronics Letters. 2026;62(1). doi:10.1049/ell2.70616

BibTeX
@article{Lin2026,
  author = {Lin, Hengqing and Wang, Linghua},
  title = {Three‐Dimensional Path Planning for Unmanned Aerial Vehicle Based on Multi‐Strategy Improved Dung Beetle Optimisation Algorithm},
  journal = {Electronics Letters},
  year = {2026},
  volume = {62},
  number = {1},
  doi = {10.1049/ell2.70616}
}
Kostenlos starten →