Conditions for the existence of a common quadratic Lyapunov function via stability analysis of matrix families

Author(s):  
R.K. Yedavalli
2020 ◽  
Vol 26 (19-20) ◽  
pp. 1765-1778
Author(s):  
Navid Vafamand

This article studies the problem of global stability of the Takagi–Sugeno fuzzy systems based on a novel descriptor-based non-quadratic Lyapunov function. A modified non-quadratic Lyapunov function, which comprises an integral term of the membership functions, and a modified non-parallel distributed controller constructed by constant delayed premise variables are considered that assure the global stability of the closed-loop T–S fuzzy system. The special structure of the used non-quadratic Lyapunov function results in time-delayed terms of the membership functions, instead of appearing their time derivatives, which is the well-known issue of the common non-quadratic Lyapunov functions in the literature. Also, the memory fuzzy controller is chosen such that the artificial constant delay-dependent stability analysis conditions for a non-delayed closed-loop T–S fuzzy system are formulated in terms of linear matrix inequalities. To further reduce the conservatives, some slack matrices are introduced by deploying the descriptor representation and decoupling lemmas. Moreover, the design of the robust fuzzy controller is studied through the [Formula: see text] performance criteria. The main advantages of the proposed approach are its small conservatives and the global stability analysis, which distinguish it from the state-of-the-art methods. To show the merits of the proposed approach, comparison results are provided, and two numerical case studies, namely, flexible joint robot and two-link joint robot are considered.


Author(s):  
Bo Xiao ◽  
Hak-Keung Lam ◽  
Zhixiong Zhong

AbstractThe main challenge of the stability analysis for general polynomial control systems is that non-convex terms exist in the stability conditions, which hinders solving the stability conditions numerically. Most approaches in the literature impose constraints on the Lyapunov function candidates or the non-convex related terms to circumvent this problem. Motivated by this difficulty, in this paper, we confront the non-convex problem directly and present an iterative stability analysis to address the long-standing problem in general polynomial control systems. Different from the existing methods, no constraints are imposed on the polynomial Lyapunov function candidates. Therefore, the limitations on the Lyapunov function candidate and non-convex terms are eliminated from the proposed analysis, which makes the proposed method more general than the state-of-the-art. In the proposed approach, the stability for the general polynomial model is analyzed and the original non-convex stability conditions are developed. To solve the non-convex stability conditions through the sum-of-squares programming, the iterative stability analysis is presented. The feasible solutions are verified by the original non-convex stability conditions to guarantee the asymptotic stability of the general polynomial system. The detailed simulation example is provided to verify the effectiveness of the proposed approach. The simulation results show that the proposed approach is more capable to find feasible solutions for the general polynomial control systems when compared with the existing ones.


Sign in / Sign up

Export Citation Format

Share Document