Indexed by:
Abstract:
This paper is concerned with the secure consensus problem of multiagent systems under switching topologies. The studied multiagent systems are affected by both denial-of-service (DoS) attacks and external disturbances. To solve the secure H∞ consensus problems, some modified definitions are presented. Some graph-based Lyapunov functions, which are based on the solutions of some Lyapunov equations and the graph information, are also designed for the H∞ performance analysis. Moreover, graph-based frequency and durations have also been presented for attaining the expected system performance. The stabilization controllers are also developed based on the solutions to some Lyapunov equations and an algebraic Riccati equation (ARE), which are easy to acquire. Some simulations are provided to validate the feasibility of the proposed scheme. © 2021 Elsevier Inc.
Keyword:
Reprint Author's Address:
Email:
Source :
Information Sciences
ISSN: 0020-0255
Year: 2021
Volume: 570
Page: 94-104
8 . 1 0 0
JCR@2022
ESI Discipline: COMPUTER SCIENCE;
ESI HC Threshold:87
JCR Journal Grade:1
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 18
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 4
Affiliated Colleges: