Domain of Attraction

Analysis and Control via SOS Programming

  • Graziano Chesi

Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 415)

Table of contents

  1. Front Matter
  2. SOS Programming

    1. Front Matter
      Pages 1-1
    2. Graziano Chesi
      Pages 3-44
    3. Graziano Chesi
      Pages 45-85
  3. Domain of Attraction

    1. Front Matter
      Pages 87-87
    2. Graziano Chesi
      Pages 89-103
    3. Graziano Chesi
      Pages 105-149
    4. Graziano Chesi
      Pages 151-196
    5. Graziano Chesi
      Pages 197-234
    6. Graziano Chesi
      Pages 235-264
  4. Back Matter

About this book

Introduction

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 (possibly uncertain) non-polynomial systems. The methods proposed in this book are illustrated in a variety of real systems and simulated systems with randomly chosen structures and/or coefficients which includes chemical reactors, electric circuits, mechanical devices, and social models.

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.

Keywords

Control Theory Equilibrium Point Nonlinear Systems Sum of Squares Programming System Estimation

Authors and affiliations

  • Graziano Chesi
    • 1
  1. 1.Dept. Electrical & Electronic EngineUniversity of Hong KongHong KongChina

Bibliographic information

  • DOI https://doi.org/10.1007/978-0-85729-959-8
  • Copyright Information Springer London 2011
  • Publisher Name Springer, London
  • eBook Packages Engineering
  • Print ISBN 978-0-85729-958-1
  • Online ISBN 978-0-85729-959-8
  • Series Print ISSN 0170-8643
  • Series Online ISSN 1610-7411
  • About this book