Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = Laplacian Ironing Operator

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
27 pages, 26831 KB  
Article
KA-IHO: A Kinematic-Aware Improved Hippo Optimization Algorithm for Collision-Free Mobile Robot Path Planning in Complex Grid Environments
by Chunhong Yuan, Yule Cai, Haohua Que, Yuting Pei, Xiang Zhang, Jiayue Xie, Qian Zhang, Lei Mu and Fei Qiao
Sensors 2026, 26(8), 2416; https://doi.org/10.3390/s26082416 - 15 Apr 2026
Cited by 5 | Viewed by 592
Abstract
Autonomous path planning in obstacle-dense environments remains challenging for swarm intelligence methods due to infeasible initialization, insufficient exploration–exploitation balance, and poor trajectory smoothness for real-robot execution. To address these issues, this paper proposes a Kinematic-Aware Improved Hippo Optimization algorithm (KA-IHO) for mobile robot [...] Read more.
Autonomous path planning in obstacle-dense environments remains challenging for swarm intelligence methods due to infeasible initialization, insufficient exploration–exploitation balance, and poor trajectory smoothness for real-robot execution. To address these issues, this paper proposes a Kinematic-Aware Improved Hippo Optimization algorithm (KA-IHO) for mobile robot path planning. The proposed method integrates four components: an elite safety pool initialization strategy to improve feasible solution generation in dense maps, a hierarchical elite-scout update mechanism to better balance global exploration and local exploitation, anti-stagnation mechanisms including a Population Stagnation Restart strategy and a 10-Direction Radial Micro-Search to guarantee high feasibility rates across all map complexities, and a late-stage Laplacian Line-of-Sight Ironing Operator to reduce path redundancy and improve trajectory smoothness. Comparative experiments are conducted on five reproducible grid maps with different complexity levels (40×40 and 80×80), where KA-IHO is evaluated against six representative algorithms, including HO, SBOA, PSO, GWO, ARO, and INFO, over 20 independent runs. The results show that KA-IHO consistently achieves collision-free planning and obtains lower mean fitness values with smaller standard deviations than the compared methods, indicating improved robustness and solution quality. In addition, hardware closed-loop experiments on a differential-drive mobile robot demonstrate that the planned paths can be executed reliably in real environments, with trajectory tracking errors controlled within ±4 cm. Full article
Show Figures

Figure 1

Back to TopTop