Domain of Attraction [electronic resource] : Analysis and Control via SOS Programming / by Graziano Chesi.Material type: TextLanguage: English Series: Lecture Notes in Control and Information Sciences: 415Publisher: London : Springer London, 2011Description: XVIII, 286p. 46 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9780857299598Subject(s): Engineering | Systems theory | Physics | Engineering | Control | Systems Theory, Control | Nonlinear Dynamics | ComplexityAdditional physical formats: Printed edition:: No titleDDC classification: 629.8 LOC classification: TJ212-225Online resources: Click here to access online
Contents:In: Springer eBooksSummary: The stability of equilibrium points plays a fundamental role in dynamical systems. For nonlinear dynamical systems, which represent the majority of real plants, an investigation of stability requires the characterization of the domain of attraction (DA) of an equilibrium point, i.e., the set of initial conditions from which the trajectory of the system converges to such a point. It is well-known that estimating the DA, or even more attempting to control it, are very difficult problems because of the complex relationship of this set with the model of the system. The book also offers a concise and simple description of the main features of SOS programming which can be used in research and teaching. In particular, it introduces various classes of SOS polynomials and their characterization via LMIs and addresses typical problems such as establishment of positivity or non-positivity of polynomials and matrix polynomials, determining the minimum of rational functions, and solving systems of polynomial equations, in cases of both unconstrained and constrained variables. The techniques presented in this book are available in the MATLAB® toolbox SMRSOFT, which can be downloaded from http://www.eee.hku.hk/~chesi. Domain of Attraction addresses the estimation and control of the DA of equilibrium points using the novel SOS programming scheme, i.e., optimization techniques that have been recently developed based on polynomials that are sums of squares of polynomials (SOS polynomials) and that amount to solving convex optimization problems with linear matrix inequality (LMI) constraints, also known as semidefinite programs (SDPs). For the first time in the literature, a means of dealing with these issues is presented in a unified framework for various cases depending on the nature of the nonlinear systems considered, including the cases of polynomial systems, uncertain polynomial systems, and nonlinear (possib
SOS Polynomials -- Optimization with SOS Polynomials -- Preliminaries of Nonlinear Systems -- Domain of Attraction in Polynomial Systems -- Domain of Attraction in Uncertain Polynomial Systems -- Domain of Attraction in Non-polynomial Systems -- Domain of Attraction via Multiple Lyapunov Function -- Miscellaneous.