.png){kind=icon}
.png){kind=icon}
Return
Adaptive Secure Consensus for Nonlinear Multiagent Systems With Distributed Sequential Link Attacks Under General Directed Graphs
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.7690.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article introduces a novel adaptive secure consensus strategy for achieving secure consensus in nonlinear multi-agent systems (MASs) against distributed sequential link attacks under general directed graphs, which can be implemented in a fully distributed manner. First, communication network attacks on MASs are modeled as distributed sequential link attacks. An adaptive secure consensus protocol is then designed for nonlinear MASs to achieve fully distributed secure consensus under general directed graphs. Moreover, by decomposing the Laplacian matrix of general directed graphs, secure consensus criteria for nonlinear MASs against distributed sequential link attacks are presented, unifying leaderless and leader-follower structures into a single control framework. Finally, the effectiveness of the proposed control strategy is demonstrated through a simulation example.
Keywords:
fully distributed
general directed graphs
secure consensus
sequential link attacks
Journal
IF:
3.2
Papers:
6.9K
Citations:
1.4W
Organization
View more organizations