Estimating the domain of attraction for uncertain polynomial systems (Q1765187): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: LEDA / rank
 
Normal rank

Revision as of 22:28, 28 February 2024

scientific article
Language Label Description Also known as
English
Estimating the domain of attraction for uncertain polynomial systems
scientific article

    Statements

    Estimating the domain of attraction for uncertain polynomial systems (English)
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    The problem of estimating the robust domain of attraction is studied for a nonlinear system of the form \[ \dot x= f(x,\phi), \] where \(x\in\mathbb{R}^n\), \(\phi\) is a vector of uncertain parameter, \(\phi\in\Phi\), and \(\Phi\) is a polytope of \(\mathbb{R}^z\). The map \(f\) is assumed to be a polynomial with respect to both \(x\) and \(\phi\). The approach relies on polynomial Lyapunov functions, whose coefficients may be either constant (when the family of systems admits a common Lyapunov function) or polynomially dependent on \(\phi\). The robust domain of attraction is defined as the intersection of the domains of attraction of each individual system, as \(\phi\) varies on \(\Phi\). In order to estimate it, the author computes lower bounds for the level sets of the Lyapunov functions contained in the region where their derivatives are negative. This is done by an appropriate transformation of the system and by solving a linear matrix inequality optimization problem and an eigenvalue problem.
    0 references
    domain of attraction
    0 references
    uncertain systems
    0 references
    Lyapunov functions
    0 references
    polynomial nonlinearity
    0 references
    level sets
    0 references
    linear matrix inequality
    0 references
    eigenvalue problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references