EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Multi-Strategy-Enhanced Improved Horned Lizard Optimization Algorithm for Path Planning in Mobile Robots

Baoting Yin, He Lu, Lili Dai, Hongxing Ding

Algorithms · 01.04.2026 · 19 (4) · 272

DOI: 10.3390/a19040272 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 01.04.2026. Verfasst von Baoting Yin und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Lianyungang City Science and Technology Plan Funding Project of Jiangsu Province, Lianyungang High-level Talent Training Project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Aiming at the inherent defects of the Horned Lizard Optimization Algorithm (HLOA), such as insufficient global exploration capability, premature convergence to local optima, and inadequate balance between exploration and exploitation, this paper proposes an enhanced Improved Horned Lizard Optimization Algorithm (IHLOA) integrated with multi-strategy improvements. Firstly, the Fuch chaotic mapping is introduced for population initialization, which enhances the ergodicity and diversity of the initial population by leveraging the pseudo-random and aperiodic characteristics of chaotic sequences, laying a high-quality foundation for subsequent optimization searches. Secondly, the golden sine strategy is embedded into the iterative update process to dynamically adjust the search step size and direction. This strategy utilizes the periodic amplitude variation in the sine function and the golden section coefficient to balance the global exploration for potential optimal regions and local exploitation for refined optimization, thereby accelerating convergence speed while avoiding local stagnation. Finally, the orthogonal crossover strategy is incorporated in the late iteration stage to promote effective information interaction between parent and offspring populations. By means of chromosome segment exchange and elitist retention mechanisms, this strategy reduces dimensional search blind spots and further enhances the algorithm’s ability to capture high-quality solutions. Comprehensive experimental evaluations are conducted based on classical benchmark test functions and eight state-of-the-art meta-heuristic algorithms. The results demonstrate that the IHLOA outperforms comparative algorithms in terms of optimization accuracy, convergence speed, and stability across 30-D, 50-D, and 80-D scenarios. For practical path planning applications, the IHLOA achieves remarkable performance improvements: in single-goal path planning, it reduces the path length by 2.54–87.64% compared with benchmark algorithms; in multi-goal path planning, it realizes a 1.24–7.99% reduction in path length and an 11.91% average reduction in the number of turning points relative to the original HLOA. Additionally, the IHLOA exhibits excellent robustness and adaptability in dynamic obstacle environments, effectively shortening the path length and reducing robot stuck times. This research not only enriches the improvement framework of meta-heuristic algorithms but also provides a high-efficiency optimization solution for mobile robot path planning in complex environments.

Förderung

  • Lianyungang City Science and Technology Plan Funding Project of Jiangsu Province
  • Lianyungang High-level Talent Training Project

Zitieren

APA

Yin, B., Lu, H., Dai, L., & Ding, H. (2026). Multi-Strategy-Enhanced Improved Horned Lizard Optimization Algorithm for Path Planning in Mobile Robots. Algorithms, 19(4), 272. https://doi.org/10.3390/a19040272

Vancouver

Yin B, Lu H, Dai L, Ding H. Multi-Strategy-Enhanced Improved Horned Lizard Optimization Algorithm for Path Planning in Mobile Robots. Algorithms. 2026;19(4):272. doi:10.3390/a19040272

BibTeX
@article{Yin2026,
  author = {Yin, Baoting and Lu, He and Dai, Lili and Ding, Hongxing},
  title = {Multi-Strategy-Enhanced Improved Horned Lizard Optimization Algorithm for Path Planning in Mobile Robots},
  journal = {Algorithms},
  year = {2026},
  volume = {19},
  number = {4},
  pages = {272},
  doi = {10.3390/a19040272}
}
Kostenlos starten →