Task-Oriented Data Compression for Multi-Agent Communications Over Bit-Budgeted Channels

Various applications for inter-machine communications are on the rise. Whether it is for autonomous driving vehicles or the internet of everything, machines are more connected than ever to improve their performance in fulfilling a given task. While in traditional communications the goal has often be...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:arXiv.org
Hlavní autori: Mostaani, Arsham, Vu, Thang X, Chatzinotas, Symeon, Ottersten, Björn
Médium: Paper
Jazyk:English
Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 04.01.2023
Predmet:
Agglomeration
Algorithms
Communication
Machine learning
Markov processes
Multiagent systems
Rendezvous
ISSN:2331-8422
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Various applications for inter-machine communications are on the rise. Whether it is for autonomous driving vehicles or the internet of everything, machines are more connected than ever to improve their performance in fulfilling a given task. While in traditional communications the goal has often been to reconstruct the underlying message, under the emerging task-oriented paradigm, the goal of communication is to enable the receiving end to make more informed decisions or more precise estimates/computations. Motivated by these recent developments, in this paper, we perform an indirect design of the communications in a multi-agent system (MAS) in which agents cooperate to maximize the averaged sum of discounted one-stage rewards of a collaborative task. Due to the bit-budgeted communications between the agents, each agent should efficiently represent its local observation and communicate an abstracted version of the observations to improve the collaborative task performance. We first show that this problem can be approximated as a form of data-quantization problem which we call task-oriented data compression (TODC). We then introduce the state-aggregation for information compression algorithm (SAIC) to solve the formulated TODC problem. It is shown that SAIC is able to achieve near-optimal performance in terms of the achieved sum of discounted rewards. The proposed algorithm is applied to a geometric consensus problem and its performance is compared with several benchmarks. Numerical experiments confirm the promise of this indirect design approach for task-oriented multi-agent communications.
AbstractList Various applications for inter-machine communications are on the rise. Whether it is for autonomous driving vehicles or the internet of everything, machines are more connected than ever to improve their performance in fulfilling a given task. While in traditional communications the goal has often been to reconstruct the underlying message, under the emerging task-oriented paradigm, the goal of communication is to enable the receiving end to make more informed decisions or more precise estimates/computations. Motivated by these recent developments, in this paper, we perform an indirect design of the communications in a multi-agent system (MAS) in which agents cooperate to maximize the averaged sum of discounted one-stage rewards of a collaborative task. Due to the bit-budgeted communications between the agents, each agent should efficiently represent its local observation and communicate an abstracted version of the observations to improve the collaborative task performance. We first show that this problem can be approximated as a form of data-quantization problem which we call task-oriented data compression (TODC). We then introduce the state-aggregation for information compression algorithm (SAIC) to solve the formulated TODC problem. It is shown that SAIC is able to achieve near-optimal performance in terms of the achieved sum of discounted rewards. The proposed algorithm is applied to a geometric consensus problem and its performance is compared with several benchmarks. Numerical experiments confirm the promise of this indirect design approach for task-oriented multi-agent communications.
Author Vu, Thang X
Mostaani, Arsham
Ottersten, Björn
Chatzinotas, Symeon
Author_xml – sequence: 1
  givenname: Arsham
  surname: Mostaani
  fullname: Mostaani, Arsham
– sequence: 2
  givenname: Thang
  surname: Vu
  middlename: X
  fullname: Vu, Thang X
– sequence: 3
  givenname: Symeon
  surname: Chatzinotas
  fullname: Chatzinotas, Symeon
– sequence: 4
  givenname: Björn
  surname: Ottersten
  fullname: Ottersten, Björn
BookMark eNotjctOwzAURC0EEqX0A9hZYu1w40ceyzY8paJssmBXOfZNSWntYicVn08qWI1GZ3Tmhlw675CQuxQSWSgFDzr89KeEA6gklZzDBZlxIVJWTOWaLGLcAQDPcq6UmJGPRscvVoce3YCWPupB08ofjgFj7L2jnQ_0fdwPPVtup8mZHUbXGz1MNNL6hIGu-oGtRrvFs6H61M7hPt6Sq07vIy7-c06a56ememXr-uWtWq6ZVlyxTEqT6bLkygCX0qaiBAQOJocWeCFyyLHrpLKiNWBMIQ1Yia1qLaASgGJO7v-0x-C_R4zDZufH4KbHDZdQiAxKocQvhu5Ugw
ContentType Paper
Copyright 2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.2005.14220
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials - QC
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a525-644c6a9925c0244d1390e020c70b0283707eff45d3bc0cc84c0d4eb5bd0e530e3
IEDL.DBID BENPR
IngestDate Mon Jun 30 09:16:40 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a525-644c6a9925c0244d1390e020c70b0283707eff45d3bc0cc84c0d4eb5bd0e530e3
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2408360935?pq-origsite=%requestingapplication%
PQID 2408360935
PQPubID 2050157
ParticipantIDs proquest_journals_2408360935
PublicationCentury 2000
PublicationDate 20230104
PublicationDateYYYYMMDD 2023-01-04
PublicationDate_xml – month: 01
  year: 2023
  text: 20230104
  day: 04
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2023
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.8180603
SecondaryResourceType preprint
Snippet Various applications for inter-machine communications are on the rise. Whether it is for autonomous driving vehicles or the internet of everything, machines...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Agglomeration
Algorithms
Communication
Machine learning
Markov processes
Multiagent systems
Rendezvous
Title Task-Oriented Data Compression for Multi-Agent Communications Over Bit-Budgeted Channels
URI https://www.proquest.com/docview/2408360935
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1dS8MwFA26KfjkN37MkQdfw0LSNM2TON1Q0K3okPkkaT5kCN1su-HPN8k6RQRffCyFEtLknsO5954LwLmSmhKJIySo0MjhtUaJUBkiljIhLaEqZEyf7vhgkIzHIq0Ft7Iuq1zFxBCo9VR5jbzjrbho7NN2F7N35KdG-exqPUJjHTS9U5k7581ub5A-fKksJOaOM9NlOjOYd3Vk8TFZLMUUr3_gX0E4IEt_-79r2gHNVM5MsQvWTL4HNkNFpyr3wXgkyzc09DbGjlTCa1lJ6C__su41h46swtB9iy59dxX80SlSwqE74rA7qVB3rl-N_4LvQ8gdkh6AUb83urpB9RgFJBlhyBEeFUshCFMOjyPtKB82jiQqjjMcvG-4sTZimmYKK5VECuvIZCzT2DCKDT0EjXyamyMADTGUW2GFcsBPuBGWiCzRwlrLJYujY9Ba7dNLfRXKl-9NOvn79SnY8rPcg74RtUCjKubmDGyoRTUpi3b9Z9u-OPPRPaW39-nzJ7VqsWw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTwIxEJ4gaPTkOz5Qe9BjQ9PusvRgjIgEAgKJxHAj3T4MMVmQBdQf5X-0LaAxJt48eG7SpDvtzLffzDcDcC6FYlSQAHPGFbbxWuESlzGmhoVcGMqkz5g-NKNWq9Tr8U4G3pdaGFdWufSJ3lGroXQcecG14mJFl7a7Gj1jNzXKZVeXIzTm16Kh317sL1t6Wa9Y-15QWr3t3tTwYqoAFiENsY3_sig4p6G04SlQFgERbTGTjEhMfCuYSBsThIrFkkhZCiRRgY7DWBEdMqKZ3XYFchZFUOorBe8_KR1ajCxAZ_Pcqe8UVhDj18Fsztw4soX88Pg-jFU3_9kH2IJcR4z0eBsyOtmBNV-tKtNd6HVF-oTbrkWzBcyoIiYCOcc2r-lNkAXiyCuL8bVTjqFvKpgUte3zReXBBJen6lG7HZzGIrEoYQ-6f3GWfcgmw0QfANJUs8hww6UFNTTS3FAelxQ3xkQiLAaHkF-apb945mn_yyZHvy-fwXqte9fsN-utxjFsuJn1nscJ8pCdjKf6BFblbDJIx6f-SiHo_7EFPwAJ4QfL
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=Task-Oriented+Data+Compression+for+Multi-Agent+Communications+Over+Bit-Budgeted+Channels&rft.jtitle=arXiv.org&rft.au=Mostaani%2C+Arsham&rft.au=Vu%2C+Thang+X&rft.au=Chatzinotas%2C+Symeon&rft.au=Ottersten%2C+Bj%C3%B6rn&rft.date=2023-01-04&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2005.14220