Quantized guaranteed cost memory consensus for nonlinear multi-agent systems with switching topology and actuator faults

This paper addresses the problem of guaranteed cost consensus design for nonlinear multi-agent systems with switching topology under quantization effects and actuator faults. The primary intention of this paper is to construct a reliable controller that is robust against certain actuator faults and which retains the resulting closed-loop system to achieve consensus. In particular, weighted undirected graph is considered to represent the interconnection among agents. By taking advantage of algebraic graph theory along with the Lyapunov technique, a new set of sufficient conditions is established by means of linear matrix inequalities (LMIs) to achieve the exponential consensus of the considered nonlinear multi-agent systems (MASs) . Specifically the control gain matrices can be obtained by solving the established LMIs. Finally, numerical examples are presented to demonstrate the capability of proposed method. •Guaranteed cost consensus problem for nonlinear multi-agent systems is studied.•Undirected and switched graph is used to describe the Interactions among agents.•Reliable control design is used to solve the considered problem.