2,276 research outputs found

    Robust Stability Analysis of Nonlinear Hybrid Systems

    Get PDF
    We present a methodology for robust stability analysis of nonlinear hybrid systems, through the algorithmic construction of polynomial and piecewise polynomial Lyapunov-like functions using convex optimization and in particular the sum of squares decomposition of multivariate polynomials. Several improvements compared to previous approaches are discussed, such as treating in a unified way polynomial switching surfaces and robust stability analysis for nonlinear hybrid systems

    Positive Forms and Stability of Linear Time-Delay Systems

    Full text link
    We consider the problem of constructing Lyapunov functions for linear differential equations with delays. For such systems it is known that exponential stability implies the existence of a positive Lyapunov function which is quadratic on the space of continuous functions. We give an explicit parametrization of a sequence of finite-dimensional subsets of the cone of positive Lyapunov functions using positive semidefinite matrices. This allows stability analysis of linear time-delay systems to be formulated as a semidefinite program.Comment: journal version, 14 page

    Kuhn-Tucker-based stability conditions for systems with saturation

    Get PDF
    This paper presents a new approach to deriving stability conditions for continuous-time linear systems interconnected with a saturation. The method presented can be extended to handle a dead-zone, or in general, nonlinearities in the form of piecewise linear functions. By representing the saturation as a constrained optimization problem, the necessary (Kuhn-Tucker) conditions for optimality are used to derive linear and quadratic constraints which characterize the saturation. After selecting a candidate Lyapunov function, we pose the question of whether the Lyapunov function is decreasing along trajectories of the system as an implication between the necessary conditions derived from the saturation optimization, and the time derivative of the Lyapunov function. This leads to stability conditions in terms of linear matrix inequalities, which are obtained by an application of the S-procedure to the implication. An example is provided where the proposed technique is compared and contrasted with previous analysis methods

    Analysis of switched and hybrid systems - beyond piecewise quadratic methods

    Get PDF
    This paper presents a method for stability analysis of switched and hybrid systems using polynomial and piecewise polynomial Lyapunov functions. Computation of such functions can be performed using convex optimization, based on the sum of squares decomposition of multivariate polynomials. The analysis yields several improvements over previous methods and opens up new possibilities, including the possibility of treating nonlinear vector fields and/or switching surfaces and parametric robustness analysis in a unified way

    Robust Multi-Criteria Optimal Fuzzy Control of Continuous-Time Nonlinear Systems

    Get PDF
    This paper presents a novel fuzzy control design of continuous-time nonlinear systems with multiple performance criteria. The purpose behind this work is to improve the traditional fuzzy controller performance to satisfy several performance criteria simultaneously to secure quadratic optimality with inherent stability property together with dissipativity type of disturbance reduction. The Takagi– Sugeno fuzzy model is used in our control system design. By solving the linear matrix inequality at each time step, the control solution can be found to satisfy the mixed performance criteria. The effectiveness of the proposed technique is demonstrated by simulation of the control of the inverted pendulum system

    A new solution approach to polynomial LPV system analysis and synthesis

    Get PDF
    Based on sum-of-squares (SOS) decomposition, we propose a new solution approach for polynomial LPV system analysis and control synthesis problems. Instead of solving matrix variables over a positive definite cone, the SOS approach tries to find a suitable decomposition to verify the positiveness of given polynomials. The complexity of the SOS-based numerical method is polynomial of the problem size. This approach also leads to more accurate solutions to LPV systems than most existing relaxation methods. Several examples have been used to demonstrate benefits of the SOS-based solution approach
    corecore