Resilient algorithm for distributed resource allocation under false data injection attacks
For a first‐order nonlinear multi‐agent system who is subject to false data injection (FDI) attacks on agents' actuators and sensors, agents execute a distributed resource allocation algorithm according to the compromised control inputs and interactive information such that the multi‐agent syst...
Saved in:
| Published in: | Asian journal of control Vol. 26; no. 4; pp. 1635 - 1645 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Hoboken
Wiley Subscription Services, Inc
01.07.2024
|
| Subjects: | |
| ISSN: | 1561-8625, 1934-6093 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | For a first‐order nonlinear multi‐agent system who is subject to false data injection (FDI) attacks on agents' actuators and sensors, agents execute a distributed resource allocation algorithm according to the compromised control inputs and interactive information such that the multi‐agent system is unstable and agents' decisions deviate from the optimal resource allocation. At first, we analyze the robustness of the distributed resource allocation algorithm under the FDI attacks. Then, a resilient distributed algorithm is proposed to solve the distributed resource allocation problem by resisting the adverse effect of the attacks. In detail, the unknown nonlinear term and the false data injected in agents are considered as extended states that can be estimated by extended state observers. The estimation is used in the feedback control to suppress the effect of the FDI attacks. As a result, the designed resilient algorithm ensures that agents' decisions converge to the optimal allocation without requiring any information about the nature of the attacks. An example is given to illustrate the results. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1561-8625 1934-6093 |
| DOI: | 10.1002/asjc.3440 |