Multiple Robots Autonomous Task Planning Based on Improved Genetic Algorithm

This paper presents an autonomous task planning method for multiple collecting robots on improved genetic algorithm. Considering the limited capacity of collecting robots and the suitability of hopping robots in the microgravity environment of small celestial bodies, we developed a task planning model based on the Capacitated Vehicle Routing Problem (CVRP) and proposed an improved genetic algorithm to simultaneously allocate tasks and plan paths for multiple collecting robots. During robot movement, the A * algorithm is employed for active obstacle avoidance when unknown obstacles are encountered. Experimental results demonstrated that our algorithm, can efficiently allocate tasks for the robot group, and each robot actively avoiding obstacles during movement.

Authors

Institutions

Publication Details

Published
2024-12-10
DOI
https://doi.org/10.1109/robio64047.2024.10907412
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multiple Robots Autonomous Task Planning Based on Improved Genetic Algorithm

Xingchen Lv, Wangwang Liu, Qingjie Zhao, Lei Wang et al.
1 citations
Robotic Path Planning Algorithms
0.25
article

Multiple Robots Autonomous Task Planning Based on Improved Genetic Algorithm

Xingchen Lv, Wangwang Liu, Qingjie Zhao, Lei Wang, Zhiyuan Yang
article en
1 citations

Abstract

This paper presents an autonomous task planning method for multiple collecting robots on improved genetic algorithm. Considering the limited capacity of collecting robots and the suitability of hopping robots in the microgravity environment of small celestial bodies, we developed a task planning model based on the Capacitated Vehicle Routing Problem (CVRP) and proposed an improved genetic algorithm to simultaneously allocate tasks and plan paths for multiple collecting robots. During robot movement, the A * algorithm is employed for active obstacle avoidance when unknown obstacles are encountered. Experimental results demonstrated that our algorithm, can efficiently allocate tasks for the robot group, and each robot actively avoiding obstacles during movement.

Beijing Institute of Technology (CN)
Openalex Percentile: Top 42%
Robotic Path Planning Algorithms
0.25
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.