2009 American Control Conference 2009
DOI: 10.1109/acc.2009.5160175
|View full text |Cite
|
Sign up to set email alerts
|

Ellipsoidal approximations to attraction domains of linear systems with bounded control

Abstract: We are concerned with characterization of attraction domains for linear state-space systems. Considered are bounded linear state feedback control and saturated control. Attraction domains for such systems are described in terms of invariant ellipsoids using LMI-based techniques and semidefinite programming (SDP). For systems with saturated control, the ideology of absolute stability is adopted. An application to nonlinear systems is provided.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 11 publications
0
7
0
Order By: Relevance
“…In [28], the authors use ellipsoids to approximate polytopes. Ellipsoidal approximation is also widely used in control problems to describe the attraction domain [29] and to approximated polyhedral sets in power systems [30].…”
Section: A Prior Resultsmentioning
confidence: 99%
“…In [28], the authors use ellipsoids to approximate polytopes. Ellipsoidal approximation is also widely used in control problems to describe the attraction domain [29] and to approximated polyhedral sets in power systems [30].…”
Section: A Prior Resultsmentioning
confidence: 99%
“…x = x − x s and ū = u − u s . Following the linearization, a semi-definite program (SDP) is formulated according to the work by Polyak and Shcherbakov [25]. The SDP to be solved is presented in Optimization problem (18).…”
Section: Modification Of the Target Zonementioning
confidence: 99%
“…x s ,u s are matrices of appropriate dimensions, and x and ū denote the system states and input in deviation form, i.e., x = x − x s and ū = u − u s . Following the linearization, a semi-definite program (SDP) is formulated according to the work by Polyak and Shcherbakov [28]. The SDP to be solved is presented in Optimization problem described by Equations ( 40…”
Section: Modification Of the Target Zonementioning
confidence: 99%