Secure consensus of multiagent systems with DoS attacks via a graph-based approach

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-infinity 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-infinity 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. (C) 2021 Elsevier Inc. All rights reserved.