Robust Average Consensus under Byzantine Attacks

We study the problem of average consensus in multi-agent systems where some of the agents may malfunction. The object of robust average consensus is for non-faulty agents to converge to the average value of their initial values despite the erroneous effects from adversarial agents. To this end, we p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the IEEE Conference on Decision & Control S. 3839 - 3844
Hauptverfasser: Yuan, Liwei, Ishii, Hideaki, Wang, Yaonan
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 16.12.2024
Schlagworte:
ISSN:2576-2370
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We study the problem of average consensus in multi-agent systems where some of the agents may malfunction. The object of robust average consensus is for non-faulty agents to converge to the average value of their initial values despite the erroneous effects from adversarial agents. To this end, we propose a surplus-based consensus algorithm that can achieve robust average consensus under Byzantine attacks in the multi-agent networks with directed topologies. The key idea is to equip each normal agent with a running-sum variable so that it can record the effects from/to neighbors across iterations. Moreover, compared to the existing secure broadcast and retrieval approach where each agent keeps track of the initial values of all agents in the network, our algorithm saves massive storage especially for large-scale networks as each agent only requires the values and the correct detection of neighbors. Finally, numerical examples are given for verifying the effectiveness of our algorithm.
AbstractList We study the problem of average consensus in multi-agent systems where some of the agents may malfunction. The object of robust average consensus is for non-faulty agents to converge to the average value of their initial values despite the erroneous effects from adversarial agents. To this end, we propose a surplus-based consensus algorithm that can achieve robust average consensus under Byzantine attacks in the multi-agent networks with directed topologies. The key idea is to equip each normal agent with a running-sum variable so that it can record the effects from/to neighbors across iterations. Moreover, compared to the existing secure broadcast and retrieval approach where each agent keeps track of the initial values of all agents in the network, our algorithm saves massive storage especially for large-scale networks as each agent only requires the values and the correct detection of neighbors. Finally, numerical examples are given for verifying the effectiveness of our algorithm.
Author Wang, Yaonan
Ishii, Hideaki
Yuan, Liwei
Author_xml – sequence: 1
  givenname: Liwei
  surname: Yuan
  fullname: Yuan, Liwei
  email: yuanliwei@hnu.edu.cn
  organization: Hunan University,College of Electrical and Information Engineering,Changsha,China,410082
– sequence: 2
  givenname: Hideaki
  surname: Ishii
  fullname: Ishii, Hideaki
  email: hideaki_ishii@ipc.i.u-tokyo.ac.jp
  organization: The University of Tokyo,Department of Information Physics and Computing,Tokyo,Japan,113-8656
– sequence: 3
  givenname: Yaonan
  surname: Wang
  fullname: Wang, Yaonan
  email: yaonan@hnu.edu.cn
  organization: Hunan University,College of Electrical and Information Engineering,Changsha,China,410082
BookMark eNo1j8tKw0AUQEdRsK39A5H8QNo7c-e5jLFqoSCIrstk5kbiYyKZRKhfr6BuztkdOHN2kvpEjF1yWHEObl1f10obIVcCfsDBWq2UOmJLZ5xFBcg1ojtmM6GMLgUaOGPznF8A0DmJMwYPfTPlsag-afDPVNR9ypTylIspRRqKq8OXT2OXqKjG0YfXfM5OW_-WafnnBXu62TzWd-Xu_nZbV7uy40aPpSJuA5IOLtjIDXlSEJWXLgjZtMJpiFqCBtkq4XUIIoAmaC3KhtsYBS7YxW-3I6L9x9C9--Gw_z_Eb7YXRqk
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/CDC56724.2024.10886555
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 Economics
Engineering
EISBN 9798350316339
EISSN 2576-2370
EndPage 3844
ExternalDocumentID 10886555
Genre orig-research
GrantInformation_xml – fundername: Technology Development
  funderid: 10.13039/100006180
– fundername: National Natural Science Foundation of China
  funderid: 10.13039/501100001809
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-5e18c3e6c9c8d17eae50d5a49c24bf2960d640604f52a6cc2c06e0f834b18dd23
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001445827203045&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-5e18c3e6c9c8d17eae50d5a49c24bf2960d640604f52a6cc2c06e0f834b18dd23
PageCount 6
ParticipantIDs ieee_primary_10886555
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.8926835
Snippet We study the problem of average consensus in multi-agent systems where some of the agents may malfunction. The object of robust average consensus is for...
SourceID ieee
SourceType Publisher
StartPage 3839
SubjectTerms Consensus algorithm
Economics
Multi-agent systems
Network topology
Topology
Title Robust Average Consensus under Byzantine Attacks
URI https://ieeexplore.ieee.org/document/10886555
WOSCitedRecordID wos001445827203045&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/eLvHCXMwlZ3PS8MwFMcfbgjqRZ0Tf9OD12qTpkl6nNPhQcYQhd1GfrzCLpus3UD_evO61R8HD15CCJTCS5rXvLzP-wJcK25silpSDCCPRejHVnIVG61QCsNS6euS-U9qONTjcT7awOo1C4OIdfIZ3lC3vsv3c7ekUFn4wjVxlFkLWkrJNazVbLvB0Yp0gwCzJL_t3_czqTiFTULTPPlLQ6V2IYP9f778ALrfMF40-nIzh7CFsw7sNEBx2YG9HzUFjyB5nttlWUW9sEbDXhGRIifJWZQR4WKL6O79w5A6BEa9qiLAvguvg4eX_mO8kUWIp0zJKs6QaZeidLnTnik0mCU-MyJ3XNiChyOJl4Jq4hQZN5QW7RKJSaFTYZn2nqfH0J7NZ3gCkfO5tmmhrLZM2CTX0oYfSG-84uGQrc0pdMkQk7d15YtJY4OzP8bPYZfMTekeTF5Au1os8RK23aqalourer4-AaYjlbs
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMcfOoXpRZ0Tf9uD12qTpkl6nNMxcY4hE3Yb-fEKu2xj7QT960261R8HD15CCJTCS5rXvLzP-wJcC6p0jJL7GEAaMtcPNaciVFIgZ4rE3JYl83ui35ejUTpYw-olC4OIZfIZ3vhueZdvZ2bpQ2XuC5eeo0w2YSthjEYrXKvaeJ2rZfEaAiZRetu-bydcUB84cU317C8VldKJdPb--fp9aH7jeMHgy9EcwAZOG1CvkOK8Abs_qgoeQvQy08u8CFpulbrdIvCanF7QIg88MLYI7t4_lNeHwKBVFB6xb8Jr52HY7oZrYYRwQgQvwgSJNDFykxppiUCFSWQTxVJDmc6oO5RYznxVnCyhyidGm4hjlMmYaSKtpfER1KazKR5DYGwqdZwJLTVhOkol1-4X0iorqDtmS3UCTW-I8XxV-2Jc2eD0j_ErqHeHz71x77H_dAY73vQ--YPwc6gViyVewLZ5Kyb54rKcu0-iB5kC
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=Robust+Average+Consensus+under+Byzantine+Attacks&rft.au=Yuan%2C+Liwei&rft.au=Ishii%2C+Hideaki&rft.au=Wang%2C+Yaonan&rft.date=2024-12-16&rft.pub=IEEE&rft.eissn=2576-2370&rft.spage=3839&rft.epage=3844&rft_id=info:doi/10.1109%2FCDC56724.2024.10886555&rft.externalDocID=10886555