Resilient Distributed Optimization With Event‐Triggered Interaction Design for Multiagent Systems Under False Data Injection Attacks
ABSTRACT This article explores a novel design of a resilient interaction algorithm for multiagent systems (MAS) based on an event‐triggered mechanism, focusing on distributed optimization in the context of False Data Injection Attack (FDIA). A network‐level defense strategy is used based on a virtua...
Uložené v:
| Vydané v: | International journal of robust and nonlinear control Ročník 35; číslo 16; s. 6778 - 6788 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Hoboken, USA
John Wiley & Sons, Inc
10.11.2025
Wiley Subscription Services, Inc |
| Predmet: | |
| ISSN: | 1049-8923, 1099-1239 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | ABSTRACT
This article explores a novel design of a resilient interaction algorithm for multiagent systems (MAS) based on an event‐triggered mechanism, focusing on distributed optimization in the context of False Data Injection Attack (FDIA). A network‐level defense strategy is used based on a virtual system framework, where virtual state variables are introduced to ensure that the local estimate of each agent converges to the optimal solution of the distributed optimization problem, even under unknown FDIA. The article further introduces an event‐triggered strategy that significantly reduces communication overhead, and proper selection criteria are given for picking suitable event‐triggered parameters therein. It is proved that the proposed algorithm also avoids the Zeno behavior. Additionally, a distributed detection method is designed to accurately identify and isolate compromised links, thereby further enhancing the system's resilience. Two numerical simulations are conducted to illustrate the performance of the proposed algorithm, and it is demonstrated that the algorithm can also maintain effectiveness for networks with relatively large‐scale sizes. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1049-8923 1099-1239 |
| DOI: | 10.1002/rnc.70008 |