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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE robotics and automation letters Ročník 10; číslo 10; s. 10074 - 10081
Hlavní autoři: Wang, Shengli, Li, Simin, Huangfu, Yafan, Qiu, Yongtao, Liu, Youjiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.10.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2377-3766, 2377-3766
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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.
AbstractList 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.
Author Liu, Youjiang
Huangfu, Yafan
Qiu, Yongtao
Li, Simin
Wang, Shengli
Author_xml – sequence: 1
  givenname: Shengli
  orcidid: 0000-0002-7244-2479
  surname: Wang
  fullname: Wang, Shengli
  email: wsl528300@163.com
  organization: Institute of Electronic Engineering, CAEP, Mianyang, China
– sequence: 2
  givenname: Simin
  orcidid: 0000-0001-6355-2978
  surname: Li
  fullname: Li, Simin
  email: annelsm@163.com
  organization: Institute of Electronic Engineering, CAEP, Mianyang, China
– sequence: 3
  givenname: Yafan
  surname: Huangfu
  fullname: Huangfu, Yafan
  email: hfyf12@163.com
  organization: Institute of Electronic Engineering, CAEP, Mianyang, China
– sequence: 4
  givenname: Yongtao
  orcidid: 0000-0003-2214-1464
  surname: Qiu
  fullname: Qiu, Yongtao
  email: qiuyt685@163.com
  organization: Institute of Electronic Engineering, CAEP, Mianyang, China
– sequence: 5
  givenname: Youjiang
  orcidid: 0000-0001-9012-4311
  surname: Liu
  fullname: Liu, Youjiang
  email: liuyj04@163.com
  organization: Institute of Electronic Engineering, CAEP, Mianyang, China
BookMark eNpNkDtPwzAUhS1UJErpzsAQiTnFj8Ruxqg8pSAkWgYmy3GuK5c8ip0M5dfjKpVgOnf4zrn3nks0absWELomeEEIzu6K93xBMU0XLM1EhvEZmlImRMwE55N_8wWae7_DGJOUCpalU_S56ppmaK1Wve3a-MEYqy20fXQPOohTtf2BKtoo_xXldd2NXGQ6FxXKbSFea1VD9DrUvY3z7dG5PvgeGn-Fzo2qPcxPOkMfjw-b1XNcvD29rPIi1jQRfUyoWoYXTFJpRVIGRiiuIOUZrXiVAVcihSqruNGiNDycrUjJRUJxtSx5iZdshm7H3L3rvgfwvdx1g2vDSslowhmlnOJA4ZHSrvPegZF7ZxvlDpJgeexQhg7lsUN56jBYbkaLBYA_nJCQyAT7BRrrbyE
CODEN IRALC6
Cites_doi 10.1142/S1793962318500356
10.1109/ibica.2011.56
10.1016/j.procs.2015.05.071
10.1109/LRA.2024.3396097
10.1109/iros.2004.1389434
10.1109/TASE.2017.2679278
10.3390/systems13020127
10.1109/TCYB.2015.2418052
10.1504/IJISTA.2015.074078
10.1109/ACAIT53529.2021.9731129
10.1109/SysCon61195.2024.10553609
10.1002/sec.631
10.1109/3477.484436
10.1007/s11633-010-0539-z
10.1109/TCYB.2017.2743164
10.1109/TITS.2016.2645278
10.1007/s10846-015-0190-6
10.1109/LRA.2021.3057559
10.1109/ICCAS.2013.6704241
10.1007/978-3-319-94580-4_38
10.1109/ICNN.1995.488968
10.1109/TRO.2009.2022423
10.1109/LRA.2019.2963646
10.1002/rnc.5092
10.1109/TRA.2002.803462
10.1007/978-3-319-18299-5_2
10.1109/TASE.2023.3281577
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/LRA.2025.3597900
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Xplore
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2377-3766
EndPage 10081
ExternalDocumentID 10_1109_LRA_2025_3597900
11122637
Genre orig-research
GrantInformation_xml – fundername: Presidential Foundation of China Academy of Engineering Physics
  grantid: YZJJZL2024074
GroupedDBID 0R~
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
IFIPE
IPLJI
JAVBF
KQ8
M43
M~E
O9-
OCL
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c247t-12a8109f4dca153ef7a6ae5692d6d9e6a75ed9d6fc7bf6527a1b67420d8b6b083
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001563969800016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2377-3766
IngestDate Sat Nov 22 13:41:07 EST 2025
Sat Nov 29 07:38:05 EST 2025
Wed Aug 27 07:37:17 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 10
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c247t-12a8109f4dca153ef7a6ae5692d6d9e6a75ed9d6fc7bf6527a1b67420d8b6b083
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-6355-2978
0000-0001-9012-4311
0000-0003-2214-1464
0000-0002-7244-2479
PQID 3246322620
PQPubID 4437225
PageCount 8
ParticipantIDs crossref_primary_10_1109_LRA_2025_3597900
ieee_primary_11122637
proquest_journals_3246322620
PublicationCentury 2000
PublicationDate 2025-10-01
PublicationDateYYYYMMDD 2025-10-01
PublicationDate_xml – month: 10
  year: 2025
  text: 2025-10-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE robotics and automation letters
PublicationTitleAbbrev LRA
PublicationYear 2025
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref17
ref16
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref27
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref21
  doi: 10.1142/S1793962318500356
– ident: ref20
  doi: 10.1109/ibica.2011.56
– ident: ref1
  doi: 10.1016/j.procs.2015.05.071
– ident: ref4
  doi: 10.1109/LRA.2024.3396097
– ident: ref18
  doi: 10.1109/iros.2004.1389434
– ident: ref25
  doi: 10.1109/TASE.2017.2679278
– ident: ref17
  doi: 10.3390/systems13020127
– ident: ref24
  doi: 10.1109/TCYB.2015.2418052
– ident: ref6
  doi: 10.1504/IJISTA.2015.074078
– ident: ref11
  doi: 10.1109/ACAIT53529.2021.9731129
– ident: ref16
  doi: 10.1109/SysCon61195.2024.10553609
– ident: ref22
  doi: 10.1002/sec.631
– ident: ref14
  doi: 10.1109/3477.484436
– ident: ref5
  doi: 10.1007/s11633-010-0539-z
– ident: ref26
  doi: 10.1109/TCYB.2017.2743164
– ident: ref3
  doi: 10.1109/TITS.2016.2645278
– ident: ref7
  doi: 10.1007/s10846-015-0190-6
– ident: ref10
  doi: 10.1109/LRA.2021.3057559
– ident: ref13
  doi: 10.1109/ICCAS.2013.6704241
– ident: ref2
  doi: 10.1007/978-3-319-94580-4_38
– ident: ref15
  doi: 10.1109/ICNN.1995.488968
– ident: ref23
  doi: 10.1109/TRO.2009.2022423
– ident: ref9
  doi: 10.1109/LRA.2019.2963646
– ident: ref12
  doi: 10.1002/rnc.5092
– ident: ref19
  doi: 10.1109/TRA.2002.803462
– ident: ref8
  doi: 10.1007/978-3-319-18299-5_2
– ident: ref27
  doi: 10.1109/TASE.2023.3281577
SSID ssj0001527395
Score 2.3050165
Snippet This letter presents a novel method to solve the decentralized task allocation problem for large-scale multi-agent systems (MASs), with an emphasis on...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Index Database
Publisher
StartPage 10074
SubjectTerms 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
Title Communication-Efficient Decentralized Task Allocation for Large-Scale Multi-Agent Systems
URI https://ieeexplore.ieee.org/document/11122637
https://www.proquest.com/docview/3246322620
Volume 10
WOSCitedRecordID wos001563969800016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Xplore
  customDbUrl:
  eissn: 2377-3766
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001527395
  issn: 2377-3766
  databaseCode: RIE
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2377-3766
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001527395
  issn: 2377-3766
  databaseCode: M~E
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED7RigEGnkUUSuWBhcFt6iR2PVZQxFAqBEUqU-TEF6kCtagPBgZ-O2c3VYsQA1sGx4nu7Lvv7PvuAC6lxFCQbeSRDAyPlJU8TU3EhTDKxiJ3Jc18swnV77eHQ_1QkNU9FwYRffIZNtyjv8u3k2zhjsqatC8JLYSqBCWl5JKstT5QcaXEdLy6igx0s_fYoQBQxI2QULN2HLYN1-N7qfwywN6r3O7_838OYK-Aj6yz1PchbOH4CHY3igoew8sPzgfv-hoRNA-7wSITc_SJlg3M7JV13pwvc-MYgVfWc2nh_InUhswzc3nHMa9YUda8As-33cH1HS8aKPBMRGrOW8K0SRB5ZDNDlg1zZaTBWGphpdUojYrRauvoPmkuSX6mlUqKlQPbTmVK4OwEyuPJGE-BEbIIbcukLniNUp1pjXEeOZpriIpcfhWuVrJN3pd1MhIfXwQ6IT0kTg9JoYcqVJws1-MKMVahttJGUuykWUKAT9I3pQjO_njtHHbc7MsMuxqU59MFXsB29jEfzaZ1KN1_det-qXwDSKK8GQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8MwDLVgIAEHvhGDATlw4ZCtS9t0OVbABKJMCIYEpyptXGkCDcQGB349TpaJIcSBWw9pU9mJ_Zz42QDHUmIoyDbySAaaR4mRvCh0xIXQiYlFZUuauWYTSa_XeXhQN56s7rgwiOiSz7BpH91dvnkp3-1RWYv2JaGFMJmHBds6y9O1vo9UbDExFU8vIwPVym5TCgFF3AwJNyvLYptxPq6byi8T7PxKd-2ff7QOqx5AsnSi8Q2Yw-EmrMyUFdyCxx-sD37uqkTQd9gZ-lzMwSca1tejJ5Y-W29mxzGCryyzieH8jhSHzHFzeWq5V8wXNt-G--55__SC-xYKvBRRMuZtoTskiCoypSbbhlWipcZYKmGkUSh1EqNRxhJ-ikqS_HS7kBQtB6ZTyILg2Q7Uhi9D3AVG2CI0bV3Y8DUqVKkUxlVkia4hJuT063AylW3-OqmUkbsII1A56SG3esi9HuqwbWX5Pc6LsQ6NqTZyv5dGOUE-SXNKEez98doRLF30r7M8u-xd7cOynWmSb9eA2vjtHQ9gsfwYD0Zvh27BfAHLl74x
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Communication-Efficient+Decentralized+Task+Allocation+for+Large-Scale+Multi-Agent+Systems&rft.jtitle=IEEE+robotics+and+automation+letters&rft.au=Wang%2C+Shengli&rft.au=Li%2C+Simin&rft.au=Huangfu%2C+Yafan&rft.au=Qiu%2C+Yongtao&rft.date=2025-10-01&rft.issn=2377-3766&rft.eissn=2377-3766&rft.volume=10&rft.issue=10&rft.spage=10074&rft.epage=10081&rft_id=info:doi/10.1109%2FLRA.2025.3597900&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LRA_2025_3597900
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2377-3766&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2377-3766&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2377-3766&client=summon