PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 17, 2026Sensors5 citationsOpen Access

KA-IHO: A Kinematic-Aware Improved Hippo Optimization Algorithm for Collision-Free Mobile Robot Path Planning in Complex Grid Environments

View Full Paper
CYC. Z. YuanYCYule CaiHQHaohua Que

Key Points

  • The aim is to improve mobile robot path planning in complex environments using KA-IHO, addressing challenges in obstacle-dense areas.
  • Developed kinematic-aware improved hippo optimization algorithm (KA-IHO) for path planning.
  • Implemented elite safety pool initialization for feasible solutions in dense maps.
  • Introduced a hierarchical elite-scout update for better exploration-exploitation balance.
  • Applied anti-stagnation strategies including Population Stagnation Restart and 10-Direction Radial Micro-Search.
  • Executed hardware closed-loop experiments on a differential-drive mobile robot.
  • KA-IHO consistently achieves collision-free planning across different maps.
  • Lower mean fitness values and smaller standard deviations were observed compared to six other algorithms.
  • In real-world experiments, trajectory tracking errors were maintained within ±4 cm.

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 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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Yuan et al. (2026) studied this question.

synapsesocial.com/papers/69e1cffa5cdc762e9d858f51https://doi.org/10.3390/s26082416
Ask AI
Helpful
Bookmark
Share
View Full Paper