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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
