Domain of Attraction: Analysis and Control via SOS Programming
Springer Science & Business Media, Aug 21, 2011 - Technology & Engineering - 286 pages
For nonlinear dynamical systems, which represent the majority of real devices, any study of stability requires the investigation of the domain of attraction of an equilibrium point, i.e. the set of initial conditions from which the trajectory of the system converges to equilibrium. Unfortunately, both estimating and attempting to control the domain of attraction are very difficult problems, because of the complex relationship of this set with the model of the system. Domain of Attraction addresses the estimation and control of the domain of attraction of equilibrium points via SOS programming, i.e. optimization techniques based on the sum of squares of polynomials (SOS) that have been recently developed and that amount to solving convex problems with linear matrix inequality constraints. A unified framework for addressing these issues is presented for in various cases depending on the nature of the nonlinear systems considered, including the cases of polynomial, non-polynomial, certain and uncertain systems. The methods proposed are illustrated various example systems such as electric circuits, mechanical devices, and nuclear plants. Domain of Attraction also deals with related problems that can be considered within the proposed framework, such as characterizing the equilibrium points and bounding the trajectories of nonlinear systems, and offers a concise and simple description of the main features of SOS programming, which can be used for general purpose in research and teaching.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
ˆγ 11 holds boundary bpol(x,m chosen common equilibrium point condition for establishing Consider f consider the problem constraints controller convex optimization Corollary curve v(x define deﬁnite degree denote Example Figure shows ﬁnd ﬁxed following result provides GEVP hence homogeneous polynomial Hurwitz implies integer LEDA LERDA Let f Let us consider let us deﬁne let us introduce Let us observe LFfor the origin linear subspace LMI feasibility test locally asymptotically stable locally quadratic polynomial lower bound matrix polynomials monomials Moreover non-polynomial systems nonempty nonnegative obtained optimal value optimization problem outer estimate parameter parameter-dependent LF parameter-dependent polynomials positive definite positive semidefinite power vector rational function satisﬁes satisfying scalar variables semialgebraic set sequel SMR matrix Speciﬁcally stable equilibrium point sublevel set Suppose symmetric matrix Taylor expansions temporal derivative Theorem tight trace(Q1 uncertain polynomial systems upper bound variable LFs ver(E xinit θ Θ