EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An Improved Advanced Social Memory Optimization Framework for Global Optimization Problem and UAV Obstacle Avoidance Trajectory Planning

Meng Zhang, Ruibo Sun, Lei Kou

Mathematics · 29.10.2026 · 14 (21) · 3955

DOI: 10.3390/math14213955 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 29.10.2026. Verfasst von Meng Zhang und 2 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Shandong Provincial Education and Teaching Research Project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper addresses the limitations of the Advanced Social Memory Optimization (ASMO) algorithm in solving high-dimensional complex optimization problems, such as premature convergence, insufficient population diversity, and limited local search capability. To overcome these issues, an Improved Advanced Social Memory Optimization (IASMO) algorithm is proposed. By incorporating a better–worse collaborative guidance strategy, an adaptive Cauchy–Gaussian exploitation strategy, and a financial investment strategy, the proposed algorithm aims to enhance global exploration and local exploitation while improving search stability through a return–risk balancing mechanism. Experimental results on the IEEE CEC2017 (100-dimensional) and CEC2022 (10- and 20-dimensional) benchmark functions demonstrate that IASMO achieves competitive overall optimization performance. The Friedman average ranking results show that IASMO obtains mean ranks of 1.63, 2.42, and 1.83 on CEC2017, CEC2022 (10D), and CEC2022 (20D), respectively, ranking first among the compared algorithms in all three benchmark settings. The Wilcoxon rank-sum test provides further statistical evidence of performance differences between IASMO and the competing algorithms. To further evaluate its applicability to engineering optimization problems, IASMO is applied to three-dimensional unmanned aerial vehicle (UAV) obstacle avoidance trajectory planning and hybrid microgrid economic dispatch. In the UAV path planning experiment, IASMO achieved the lowest mean path cost of 292.5748, representing a reduction of approximately 16.91% compared with the original ASMO. In the microgrid economic dispatch problem, IASMO an average operating cost of 1.2102E+06, which is lower than those of ESLPSO (2.1004E+06), EGWO (4.8763E+06), and the original ASMO (5.5609E+07). Overall, the experimental findings indicate that IASMO provides a competitive optimization approach for complex global optimization problems, UAV trajectory planning, and microgrid economic dispatch.

Förderung

  • Shandong Provincial Education and Teaching Research Project

Zitieren

APA

Zhang, M., Sun, R., & Kou, L. (2026). An Improved Advanced Social Memory Optimization Framework for Global Optimization Problem and UAV Obstacle Avoidance Trajectory Planning. Mathematics, 14(21), 3955. https://doi.org/10.3390/math14213955

Vancouver

Zhang M, Sun R, Kou L. An Improved Advanced Social Memory Optimization Framework for Global Optimization Problem and UAV Obstacle Avoidance Trajectory Planning. Mathematics. 2026;14(21):3955. doi:10.3390/math14213955

BibTeX
@article{Zhang2026,
  author = {Zhang, Meng and Sun, Ruibo and Kou, Lei},
  title = {An Improved Advanced Social Memory Optimization Framework for Global Optimization Problem and UAV Obstacle Avoidance Trajectory Planning},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {21},
  pages = {3955},
  doi = {10.3390/math14213955}
}
Kostenlos starten →