Communication-Efficient Decentralized Task Allocation for Large-Scale Multi-Agent Systems

This letter presents a novel method to solve the decentralized task allocation problem for large-scale multi-agent systems (MASs), with an emphasis on communication efficiency. Conventional methods typically depend on sharing the localized task allocation plans of various agents across a communicati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE robotics and automation letters Jg. 10; H. 10; S. 10074 - 10081
Hauptverfasser: Wang, Shengli, Li, Simin, Huangfu, Yafan, Qiu, Yongtao, Liu, Youjiang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.10.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
and group partition
Communication
Communication networks
Communication-efficient algorithm
decentralized task allocation
Delays
Fuels
Heuristic algorithms
multi-agent system
Multi-agent systems
Multiagent systems
Network topology
Partitioning algorithms
Resource management
Servers
Wireless communication
ISSN:2377-3766, 2377-3766
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This letter presents a novel method to solve the decentralized task allocation problem for large-scale multi-agent systems (MASs), with an emphasis on communication efficiency. Conventional methods typically depend on sharing the localized task allocation plans of various agents across a communication network to facilitate a globally consistent task allocation plan for the entire MAS. However, communication capabilities are limited in most practical scenarios, which may sometimes fail to meet the demands of decentralized task allocation, especially when dealing with large numbers of agents and tasks. To address these challenges, a grouping performance impact (GPI) algorithm is proposed to minimize the total number of communications within the MAS while maintaining high task allocation performance. Agents are partitioned into various groups, with a leader agent utilized in each group to generate task allocation plans for the other follower agents. Additionally, a decentralized task allocation method for agent groups is proposed, incorporating a novel cost scheme designed to maximize the number of successfully performed tasks. Comprehensive simulations demonstrate that the proposed GPI algorithm outperforms the state-of-the-art decentralized methods by reducing communication overhead and improving the total number of successfully performed tasks.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2377-3766
2377-3766
DOI:10.1109/LRA.2025.3597900