2011 6th IEEE Conference on Industrial Electronics and Applications 2011
DOI: 10.1109/iciea.2011.5975729
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear static output feedback controller design for uncertain polynomial systems: An iterative sums of squares approach

Abstract: This paper examines the problem of designing a nonlinear static output feedback controller for uncertain polynomial systems via an iterative sums of squares approach. The derivation of the static output feedback controller is given in terms of the solvability conditions of state dependent bilinear matrix inequalities (BMIs). An iterative algorithm based on the sum of squares (SOS) decomposition is proposed to solve these state-dependent BMIs. Finally, numerical examples are provided at the end of the paper as … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(17 citation statements)
references
References 20 publications
0
17
0
Order By: Relevance
“…Otherwise, let P j = ∇ x V j,opt and j = j + 1, then go back to step (s1). Remark 3: It is worthy of noticing that, compared with some other iterative methods that deal with non-convexity of SOS decomposition, e.g., the augmented approach [14], [27], the computational cost is relatively low in IA, thus expediting the convergence speed of iterative search [28].…”
Section: B An Iterative Algorithmmentioning
confidence: 99%
“…Otherwise, let P j = ∇ x V j,opt and j = j + 1, then go back to step (s1). Remark 3: It is worthy of noticing that, compared with some other iterative methods that deal with non-convexity of SOS decomposition, e.g., the augmented approach [14], [27], the computational cost is relatively low in IA, thus expediting the convergence speed of iterative search [28].…”
Section: B An Iterative Algorithmmentioning
confidence: 99%
“…For any non-negative integers i 1 , i 2 satisfying i 1 < i 2 , the tunable variables in F i1 are always a subset of the tunable variables in F i2 . Hence, (17) can be resolved by solving a sequence of convex optimization problems:…”
Section: The Structure Of Small-feedback Controllermentioning
confidence: 99%
“…However, using SOS techniques for optimal control, as for example in [13][14][15], is subject to a generic dif culty: the problem of simultaneously optimizing both the control and the Lyapuniov function is non-convex. Iterative procedures were proposed for overcoming this dif culty [14,16,17]. However, the iterations can diverge and seeking the global extremum is often difcult.…”
Section: Introductionmentioning
confidence: 99%
“…These advances have emerged as a promising and numerically tractable basis to solve many computationally hard problems in control for systems whose dynamics are described by polynomial functions, e.g. [5][6][7]. The application of such methods to various problems in fluid dynamics, from stability analysis to bounds on time averaged quantities, is discussed in Ref.…”
Section: Introductionmentioning
confidence: 99%