Multi-robot Path Planning Based on Two-stage Genetic Algorithm Using Direction Ordering Chromosome

Efficient collision-free path planning is crucial in multi-robot systems. This paper presents a path planning strategy for multiple robots navigating environments with grid-patterned obstacles, using a genetic algorithm. A novel chromosome structure, termed the direction ordering chromosome, is introduced to represent each robot’s movement directions and idle time. This representation reduces potential path solutions and aids the genetic population in converging on a viable and conflict-free path. The adoption of a two-stage genetic algorithm also enables the discovery of solutions with fewer inter-robot conflicts and reduced unnecessary stoppages. Simulation results showed that the two-stage genetic algorithm finds solutions more efficiently than the single-stage genetic algorithm. The proposed algorithm plans paths faster than conflict-based search when numerous robots are involved.

Authors

Publication Details

Journal
Journal of Institute of Control Robotics and Systems
Published
2025-08-01
DOI
https://doi.org/10.5302/j.icros.2025.25.0123
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 Two-stage Genetic Algorithm Using Direction Ordering Chromosome

Jeong-Hyun Park, Myun-Joong Hwang
Journal of Institute of Control Robotics and Systems
Robotic Path Planning Algorithms
article

Multi-robot Path Planning Based on Two-stage Genetic Algorithm Using Direction Ordering Chromosome

Jeong-Hyun Park, Myun-Joong Hwang
article en

Abstract

Efficient collision-free path planning is crucial in multi-robot systems. This paper presents a path planning strategy for multiple robots navigating environments with grid-patterned obstacles, using a genetic algorithm. A novel chromosome structure, termed the direction ordering chromosome, is introduced to represent each robot’s movement directions and idle time. This representation reduces potential path solutions and aids the genetic population in converging on a viable and conflict-free path. The adoption of a two-stage genetic algorithm also enables the discovery of solutions with fewer inter-robot conflicts and reduced unnecessary stoppages. Simulation results showed that the two-stage genetic algorithm finds solutions more efficiently than the single-stage genetic algorithm. The proposed algorithm plans paths faster than conflict-based search when numerous robots are involved.

Journal of Institute of Control Robotics and SystemsVol. 31(8)
Openalex Percentile: Top 80%
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.