Performance-Aware Self-Configurable Multi-Agent Networks: A Distributed Submodular Approach for Simultaneous Coordination and Network Design
We introduce the first, to our knowledge, rigorous approach that enables multi-agent networks to self-configure their communication topology to balance the trade-off between scalability and optimality during multi-agent planning. We are motivated by the future of ubiquitous collaborative autonomy wh...
Uloženo v:
| Vydáno v: | Proceedings of the IEEE Conference on Decision & Control s. 5393 - 5400 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
16.12.2024
|
| Témata: | |
| ISSN: | 2576-2370 |
| 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 | We introduce the first, to our knowledge, rigorous approach that enables multi-agent networks to self-configure their communication topology to balance the trade-off between scalability and optimality during multi-agent planning. We are motivated by the future of ubiquitous collaborative autonomy where numerous distributed agents will be coordinating via agent-to-agent communication to execute complex tasks such as traffic monitoring, event detection, and environmental exploration. But the explosion of information in such large-scale networks currently curtails their deployment due to impractical decision times induced by the computational and communication requirements of the existing near-optimal coordination algorithms. To overcome this challenge, we present the AlterNAting COordination and Network-Design Algorithm (Anaconda), a scalable algorithm that also enjoys near-optimality guarantees. Subject to the agents' bandwidth constraints, Anaconda enables the agents to optimize their local communication neighborhoods such that the action-coordination approximation performance of the network is maximized. Compared to the state of the art, Anaconda is an anytime self-configurable algorithm that quantifies its suboptimality guarantee for any type of network, from fully disconnected to fully centralized, and that, for sparse networks, is one order faster in terms of decision speed. To develop the algorithm, we quantify the suboptimality cost due to decentralization, i.e., due to communication-minimal distributed coordination. We also employ tools inspired by the literature on multi-armed bandits and submodular maximization subject to cardinality constraints. We demonstrate Anaconda in simulated scenarios of area monitoring and compare it with a state-of-the-art algorithm. |
|---|---|
| AbstractList | We introduce the first, to our knowledge, rigorous approach that enables multi-agent networks to self-configure their communication topology to balance the trade-off between scalability and optimality during multi-agent planning. We are motivated by the future of ubiquitous collaborative autonomy where numerous distributed agents will be coordinating via agent-to-agent communication to execute complex tasks such as traffic monitoring, event detection, and environmental exploration. But the explosion of information in such large-scale networks currently curtails their deployment due to impractical decision times induced by the computational and communication requirements of the existing near-optimal coordination algorithms. To overcome this challenge, we present the AlterNAting COordination and Network-Design Algorithm (Anaconda), a scalable algorithm that also enjoys near-optimality guarantees. Subject to the agents' bandwidth constraints, Anaconda enables the agents to optimize their local communication neighborhoods such that the action-coordination approximation performance of the network is maximized. Compared to the state of the art, Anaconda is an anytime self-configurable algorithm that quantifies its suboptimality guarantee for any type of network, from fully disconnected to fully centralized, and that, for sparse networks, is one order faster in terms of decision speed. To develop the algorithm, we quantify the suboptimality cost due to decentralization, i.e., due to communication-minimal distributed coordination. We also employ tools inspired by the literature on multi-armed bandits and submodular maximization subject to cardinality constraints. We demonstrate Anaconda in simulated scenarios of area monitoring and compare it with a state-of-the-art algorithm. |
| Author | Xu, Zirui Tzoumas, Vasileios |
| Author_xml | – sequence: 1 givenname: Zirui surname: Xu fullname: Xu, Zirui email: ziruixu@umich.edu – sequence: 2 givenname: Vasileios surname: Tzoumas fullname: Tzoumas, Vasileios email: vtzoumas@umich.edu organization: University of Michigan,Department of Aerospace Engineering,Ann Arbor,MI,USA,48109 |
| BookMark | eNo1kN1KwzAcxaMouM29gUheoDNpljTxrnR-wfyA6fVImn9mtE1G2jJ8Bx_agnrzO1fnB-dM0UmIARC6pGRBKVFX1ariosiXi5yMoERKIYv8CM1VoSTjhFHBmDpGk5wXIstZQc7QtOs-CGFKLdkEfb9AcjG1OtSQlQedAG-gcVkVg_O7IWnTAH4cmt5n5Q5Cj5-gP8T02V3jEq981ydvhh4s3gymjXZodMLlfp-irt_xKMYb345tHSAOHa5iTNYH3fsYsA7234ZX0PldOEenTjcdzP9yht5ub16r-2z9fPdQlevM00L0mVTcEsm0tmCAm2XtnLWkkNLUtWCF0dzxWipFwNlxZz0CaG2FoE4Yzg2boYtfrweA7T75Vqev7f977AeIxWo7 |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/CDC56724.2024.10886872 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9798350316339 |
| EISSN | 2576-2370 |
| EndPage | 5400 |
| ExternalDocumentID | 10886872 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH 6IL 6IN AAWTH ABLEC ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP M43 OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-i176t-895d083aadebe5b4cffdd0788bcc637ba5f5c8990efd039cd03e1cd661f6b55b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001445827204089&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 01:48:44 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i176t-895d083aadebe5b4cffdd0788bcc637ba5f5c8990efd039cd03e1cd661f6b55b3 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_10886872 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-Dec.-16 |
| PublicationDateYYYYMMDD | 2024-12-16 |
| PublicationDate_xml | – month: 12 year: 2024 text: 2024-Dec.-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings of the IEEE Conference on Decision & Control |
| PublicationTitleAbbrev | CDC |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0039943 |
| Score | 1.9078919 |
| Snippet | We introduce the first, to our knowledge, rigorous approach that enables multi-agent networks to self-configure their communication topology to balance the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 5393 |
| SubjectTerms | Approximation algorithms Costs Event detection Explosions Knowledge engineering Monitoring Network topology Planning Scalability Topology |
| Title | Performance-Aware Self-Configurable Multi-Agent Networks: A Distributed Submodular Approach for Simultaneous Coordination and Network Design |
| URI | https://ieeexplore.ieee.org/document/10886872 |
| WOSCitedRecordID | wos001445827204089&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI5g4gAXXkO8lQPXQF9JU25Vx8RpmjSQdpuaxEGVoEXdCn-CH43TrjwOHLhEVaW4kq3Ysft9NiFXCY9iUIllANYyjLc-U4EUePB86RpI5cJ2wybiyUTO58l0TVZvuTAA0ILP4No9tv_yTaUbVyrDEy6lkDF63M04Fh1Zq3e7GGijcE0B9r3kJhtlXMSBK5vg0u_8NUOlDSHj3X9-fI8Mv8l4dPoVZvbJBpQHZOdHH8FD8jH9hv-z9D2vgc7g2TInoXhqakePoi3VlqWOSkUnHfh7eUtTOnKtc93UKzAU3chLZRwylabrZuMUBdNZ4YCHeQlVs6RZhQlr0VURaV6aXhodtWiQIXkc3z1k92w9ZoEVfixWTCbc4EUszw0alKtIW2sM3hyk0lqEscq55RrTMg-sQTVrXMDXBgO7FYpzFR6RQVmVcExopEMrjeRBEqlIeTIJPGPBmDDkucFM54QMnWIXr10njUWv09M_3p-RbWc-Bx_xxTkZrOoGLsiWflsVy_qytf8nIzu1UA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI7QQAIuvIZ4kwPXQF9pU25VxzTEmCZtSLtNTeKgStCiPeBP8KNx2o3BgQOXKKoUV3IaO3a_zybkKuZBBDI2DMAYhv7WZdITIR48V9gCUllo6mYTUa8nRqO4vyCrV1wYAKjAZ3Btp9W_fF2quU2V4QkXIhQRWtx1HgSeU9O1loYXXW3gL0jArhPfpK2Uh5FnEyc4LNf-6qJSOZH2zj9fv0uaKzoe7X87mj2yBsU-2f5RSfCAfPZXBACWfGQToAN4McxKyJ_nE0uQohXZliWWTEV7Nfx7eksT2rLFc23fK9AUDclrqS02lSaLcuMUBdNBbqGHWQHlfErTEkPWvM4j0qzQS2m0VeFBmuSpfTdMO2zRaIHlbhTOmIi5xqtYlmncUi4DZYzWeHcQUqnQj2TGDVcYmDlgNKpZ4QCu0ujaTSg5l_4haRRlAUeEBso3QgvuxYEMpCNiz9EGtPZ9nmmMdY5J0yp2_FbX0hgvdXryx_NLstkZPnbH3fvewynZsltpwSRueEYas8kczsmGep_l08lF9S18AbdquJc |
| 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%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+IEEE+Conference+on+Decision+%26+Control&rft.atitle=Performance-Aware+Self-Configurable+Multi-Agent+Networks%3A+A+Distributed+Submodular+Approach+for+Simultaneous+Coordination+and+Network+Design&rft.au=Xu%2C+Zirui&rft.au=Tzoumas%2C+Vasileios&rft.date=2024-12-16&rft.pub=IEEE&rft.eissn=2576-2370&rft.spage=5393&rft.epage=5400&rft_id=info:doi/10.1109%2FCDC56724.2024.10886872&rft.externalDocID=10886872 |