Graph Convolutional Network-Based Multi-Agent Collaborative Task Allocation Optimization Algorithm
Journal of Computing and Electronic Information Management · 28.05.2026 · 21 (2) · 87-91
DOI: 10.54097/dtmc8r41 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computing and Electronic Information Management, online erschienen am 28.05.2026. Verfasst von Hao Yang. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
Due to the complex interdependencies between tasks, the dynamic state changes of the tasks, and the lack of flexibility of the traditional static matching method in the collaborative task allocation with multi-agent, this study aims to explore an optimization algorithm for collaborative task allocation driven by a graph convolutional network. The paper details the construction of multi-agent task graphs, the design of node features and edge weights as well as the graph convolutional feature aggregation mechanism. It also introduces updating of dynamic collaborative relationship, construction of allocation utility function and collaborative optimization process. The results of comparative and ablation experiments in a two-dimensional simulation platform show that the algorithm has a 97.4% task completion ratio and an average utility of 86.7 with an excellent allocation efficiency and convergence stability.
Zitieren
APA
Yang, H. (2026). Graph Convolutional Network-Based Multi-Agent Collaborative Task Allocation Optimization Algorithm. Journal of Computing and Electronic Information Management, 21(2), 87-91. https://doi.org/10.54097/dtmc8r41
Vancouver
Yang H. Graph Convolutional Network-Based Multi-Agent Collaborative Task Allocation Optimization Algorithm. Journal of Computing and Electronic Information Management. 2026;21(2):87-91. doi:10.54097/dtmc8r41
BibTeX
@article{Yang2026,
author = {Yang, Hao},
title = {Graph Convolutional Network-Based Multi-Agent Collaborative Task Allocation Optimization Algorithm},
journal = {Journal of Computing and Electronic Information Management},
year = {2026},
volume = {21},
number = {2},
pages = {87--91},
doi = {10.54097/dtmc8r41}
}
EUVIMED