Completely Distributed Secure Consensus for Multiagent Systems With a General Directed Graph Under Interaction Link Attacks

• Published in: IEEE systems journal Vol. 18; no. 2; pp. 1380 - 1391
• Main Authors: Zhao, Miao, Xi, Jianxiang, Le Wang, Xia, Kehan, Zheng, Yuanshi
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Completely distributed manner; Completeness; Consensus control; Couplings; Design criteria; Directed graphs; Graph theory; interaction link attacks; Laplace equations; Lipschitz nonlinearity; Matrix decomposition; Multi-agent systems; Multiagent systems; Nonlinear systems; Protocols; secure consensus control (SCC); State estimation; Topology
• ISSN: 1932-8184; 1937-9234
• DOI: 10.1109/JSYST.2024.3381914

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.