Multi‐Robot Path Planning Based on Lens Imaging Reverse Learning Harris Hawk Algorithm in Dynamic Environment

ABSTRACT To overcome the difficulties of avoiding obstacles in real time and being vulnerable to local optima in multi‐robot path planning (MRPP) in unfamiliar locations, a lens imaging reverse‐based learning Harris Hawks optimization algorithm (LRHHO) is proposed. Initially, the Latin hypercube sampling method is employed for population initialization to enhance the diversity and uniformity of the population. Subsequently, during the local exploitation phase, the lens imaging reverse‐based learning strategy is introduced to refine individual position updating mechanisms. It is complemented by an adaptive roulette wheel mechanism designed to select between current solutions and their reverse‐based counterparts. Finally, a restart mechanism is implemented for inferior individuals to improve the overall evolutionary efficacy of the population. Comprehensive evaluations on benchmark test functions demonstrate the superior optimization performance of LRHHO compared to existing algorithms. A real‐time MRPP model is constructed utilizing relative positioning methods, where LRHHO optimizes robots' velocity and angular parameters to determine subsequent positions. The system integrates three coordinated obstacle avoidance mechanisms: static obstacle avoidance, dynamic obstacle avoidance, and inter‐robot coordination, enabling rapid responses to randomly moving and unforeseen obstacles. Simulation experiments conducted in two scenarios with varying complexity levels reveal that the proposed method achieves intelligent real‐time obstacle avoidance while coordinating concurrent multi‐robot operations. Comparative results indicate that LRHHO generates higher‐quality paths with enhanced efficiency relative to alternative algorithms.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-09-10
DOI
https://doi.org/10.1002/cpe.70266
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi‐Robot Path Planning Based on Lens Imaging Reverse Learning Harris Hawk Algorithm in Dynamic Environment

Xinlu Zong, Fucai Liu, Jiaxin Hao
Concurrency and Computation Practice and Experience
Robotic Path Planning Algorithms
article

Multi‐Robot Path Planning Based on Lens Imaging Reverse Learning Harris Hawk Algorithm in Dynamic Environment

Xinlu Zong, Fucai Liu, Jiaxin Hao
article en

Abstract

ABSTRACT To overcome the difficulties of avoiding obstacles in real time and being vulnerable to local optima in multi‐robot path planning (MRPP) in unfamiliar locations, a lens imaging reverse‐based learning Harris Hawks optimization algorithm (LRHHO) is proposed. Initially, the Latin hypercube sampling method is employed for population initialization to enhance the diversity and uniformity of the population. Subsequently, during the local exploitation phase, the lens imaging reverse‐based learning strategy is introduced to refine individual position updating mechanisms. It is complemented by an adaptive roulette wheel mechanism designed to select between current solutions and their reverse‐based counterparts. Finally, a restart mechanism is implemented for inferior individuals to improve the overall evolutionary efficacy of the population. Comprehensive evaluations on benchmark test functions demonstrate the superior optimization performance of LRHHO compared to existing algorithms. A real‐time MRPP model is constructed utilizing relative positioning methods, where LRHHO optimizes robots' velocity and angular parameters to determine subsequent positions. The system integrates three coordinated obstacle avoidance mechanisms: static obstacle avoidance, dynamic obstacle avoidance, and inter‐robot coordination, enabling rapid responses to randomly moving and unforeseen obstacles. Simulation experiments conducted in two scenarios with varying complexity levels reveal that the proposed method achieves intelligent real‐time obstacle avoidance while coordinating concurrent multi‐robot operations. Comparative results indicate that LRHHO generates higher‐quality paths with enhanced efficiency relative to alternative algorithms.

Concurrency and Computation Practice and ExperienceVol. 37(23-24)
Hubei University of Technology (CN)
Openalex Percentile: Top 77%
Robotic Path Planning Algorithms
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.