.png){kind=icon}
.png){kind=icon}
Return
Completely Distributed Secure Consensus for Multiagent Systems With a General Directed Graph Under Interaction Link Attacks
.png){kind=icon}
PRE
AI
DOI：10.1109/JSYST.2024.3381914.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article investigates completely distributed secure consensus control (SCC) of high-order linear and Lipschitz nonlinear multiagent systems (MASs) in the presence of interaction link attacks, respectively, where the design criteria are independent of the interaction topology and the parameters of interaction link attacks. An estimator-based adaptive SCC protocol is proposed to realize SCC, where coupling weights of the virtual distributed reference state estimator (VDRSE) are adaptively adjusted to eliminate the impacts of interaction link attacks. Then, the leader-follower and leaderless structures are unified into a general directed graph framework by decomposing the Laplacian matrix in terms of the root node and nonroot node, and sufficient conditions for VDRSEs achieving reference state consensus and high-order linear MASs achieving SCC are given, respectively. Moreover, main results of high-order linear MASs are extended to Lipschitz nonlinear MASs. Finally, two numerical examples are presented in order to validate the theoretical results.
Keywords:
Completely distributed manner
interaction link attacks
Lipschitz nonlinearity
secure consensus control (SCC)
Journal
I
IF:
2.4
Papers:
4.5K
Citations:
387
Organization
View more organizations