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

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.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-10-29
DOI
https://doi.org/10.3390/math14213955
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Lei Kou, Meng Zhang, Ruibo Sun
2 links
Mathematics
Metaheuristic Optimization Algorithms Research
article

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

Lei Kou, Meng Zhang, Ruibo Sun
article en

Abstract

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.

MathematicsVol. 14(21)
Shandong University (CN), University of California, Los Angeles (US), Shandong Youth University of Political Science (CN)
Openalex Percentile: Top 14%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon