TY - GEN
T1 - A Multi-Robot Task Allocation Method Based on Graph Attention Network and Unsupervised Learning
AU - Wu, Zirui
AU - Li, Zhen
AU - Zhu, Dong
AU - Liao, Qiuhan
AU - Yao, Weiran
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - The task allocation for multiple robots is a critical component in the coordination of unmanned clusters.The existing heuristic algorithms are hard to achieve satisfactory results in large-scale problems, and reinforcement learning-based methods face challenges in ensuring the rationality of reward design.This paper introduces a model based on multi-head attention and graph neural networks to address the schedule-dependent multi-robot task allocation problem, trained using unsupervised learning techniques.This model can be trained with varying numbers of robots and tasks without necessitating changes to its structure or parameters.In the experiment of this paper, the model is trained under two different conditions, and the performance is evaluated across six different problem scales.Comparing the proposed model against greedy algorithms and genetic algorithms, the results demonstrate that the proposed model has significant advantages in overall performance.
AB - The task allocation for multiple robots is a critical component in the coordination of unmanned clusters.The existing heuristic algorithms are hard to achieve satisfactory results in large-scale problems, and reinforcement learning-based methods face challenges in ensuring the rationality of reward design.This paper introduces a model based on multi-head attention and graph neural networks to address the schedule-dependent multi-robot task allocation problem, trained using unsupervised learning techniques.This model can be trained with varying numbers of robots and tasks without necessitating changes to its structure or parameters.In the experiment of this paper, the model is trained under two different conditions, and the performance is evaluated across six different problem scales.Comparing the proposed model against greedy algorithms and genetic algorithms, the results demonstrate that the proposed model has significant advantages in overall performance.
KW - graph attention network
KW - multi-robot systems
KW - task allocation
KW - unsupervised learning
UR - https://www.scopus.com/pages/publications/85218057811
U2 - 10.1109/ICUS61736.2024.10840067
DO - 10.1109/ICUS61736.2024.10840067
M3 - 会议稿件
AN - SCOPUS:85218057811
T3 - Proceedings of 2024 IEEE International Conference on Unmanned Systems, ICUS 2024
SP - 1222
EP - 1227
BT - Proceedings of 2024 IEEE International Conference on Unmanned Systems, ICUS 2024
A2 - Song, Rong
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 IEEE International Conference on Unmanned Systems, ICUS 2024
Y2 - 18 October 2024 through 20 October 2024
ER -