Coordinating Cross-robot Resource for Task Allocation with Decentralized Cooperative Genetic Algorithm

This paper proposes a decentralized cooperative genetic algorithm (DCGA) to address the cross-robot resource allocation problem in leaderless multi-robot systems (MRS), where each agent is only capable of making local decisions based on local information. Inspired by the fundamental concept of divide-and-conquer in co-evolution mechanisms, the DCGA alternates between two steps: local evolution and global negotiation, within each robot. Our problem formulation enables the algorithm to effectively manage complex cross-robot constraints, which are often challenging in distributed algorithms. Unlike parallelized algorithms that necessitate agents to possess global decision-making capabilities, the DCGA facilitates the seamless integration of agents into multi-agent systems (MAS) by merely incorporating information interaction logic. Experimental results demonstrate that the DCGA is competitive in terms of optimization speed and yields superior solutions compared to centralized genetic algorithms (CGA). Furthermore, it exhibits adaptability to network latency in wireless environments.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icus61736.2024.10839870
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coordinating Cross-robot Resource for Task Allocation with Decentralized Cooperative Genetic Algorithm

Yang Yu, Jiaxing Mao, Yifan Wang
Advanced Manufacturing and Logistics Optimization
article

Coordinating Cross-robot Resource for Task Allocation with Decentralized Cooperative Genetic Algorithm

Yang Yu, Jiaxing Mao, Yifan Wang
article en

Abstract

This paper proposes a decentralized cooperative genetic algorithm (DCGA) to address the cross-robot resource allocation problem in leaderless multi-robot systems (MRS), where each agent is only capable of making local decisions based on local information. Inspired by the fundamental concept of divide-and-conquer in co-evolution mechanisms, the DCGA alternates between two steps: local evolution and global negotiation, within each robot. Our problem formulation enables the algorithm to effectively manage complex cross-robot constraints, which are often challenging in distributed algorithms. Unlike parallelized algorithms that necessitate agents to possess global decision-making capabilities, the DCGA facilitates the seamless integration of agents into multi-agent systems (MAS) by merely incorporating information interaction logic. Experimental results demonstrate that the DCGA is competitive in terms of optimization speed and yields superior solutions compared to centralized genetic algorithms (CGA). Furthermore, it exhibits adaptability to network latency in wireless environments.

China State Shipbuilding (China) (CN)
Openalex Percentile: Top 61%
Advanced Manufacturing and Logistics Optimization
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.

Coordinating Cross-robot Resource for Task Allocation with Decentralized Cooperative Genetic Algorithm — Yang Yu, Jiaxing Mao, et al. · (2024) | TGRS Research Map | TGRS