The delay-dependent absolute stability for a class of Lurie systems with interval time-varying delay is studied. By employing an augmented Lyapunov functional and combining a free-weighting matrix approach and the reciprocal convex technique, an improved stability condition is derived in terms of linear matrix inequalities （LMIs）. By retaining some useful terms that are usually ignored in the derivative of the Lyapunov function, the proposed sufficient condition depends not only on the lower and upper bounds of both the delay and its derivative, but it also depends on their differences, which has wider application fields than those of present results. Moreover, a new type of equality expression is developed to handle the sector bounds of the nonlinear function, which achieves fewer LMIs in the derived condition, compared with those based on the convex representation. Therefore, the proposed method is less conservative than the existing ones. Simulation examples are given to demonstrate the validity of the approach.
This paper deals with the problem of stabilization design for a class of continuous-time Takagi-Sugeno（T-S）fuzzy systems.New stabilization conditions are derived based on a relaxed approach in which both fuzzy Lyapunov functions and staircase membership functions are used.Through the staircase membership functions approximating the continuous membership functions of the given fuzzy model,the information of the membership functions can be brought into the stabilization design of the fuzzy systems,thereby significantly reducing the conservativeness in the existing stabilization conditions of the T-S fuzzy systems.Unlike some previous fuzzy Lyapunov function approaches reported in the literature,the proposed stabilization conditions do not depend on the time-derivative of the membership functions that may be the main source of conservatism when considering fuzzy Lyapunov functions analysis.Moreover,conditions for the solvability of the controller design are written in the form of linear matrix inequalities,but not bilinear matrix inequalities,which are easier to be solved by convex optimization techniques.A simulation example is given to demonstrate the validity of the proposed approach.
