2008
DOI: 10.1016/j.automatica.2008.03.010
|View full text |Cite
|
Sign up to set email alerts
|

Local stability analysis using simulations and sum-of-squares programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
217
0
2

Year Published

2011
2011
2017
2017

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 207 publications
(219 citation statements)
references
References 17 publications
0
217
0
2
Order By: Relevance
“…The computational algorithm is briefly described here and full algorithmic details are provided elsewhere (Jarvis-Wloszek, 2003;Jarvis-Wloszek et al, 2003;Tan and Packard, 2004;Jarvis-Wloszek et al, 2005;Tan, 2006;Topcu et al, 2007Topcu et al, , 2008. Lemma 1 is the main Lyapunov theorem used to compute lower bounds on β * .…”
Section: Region Of Attraction Estimationmentioning
confidence: 99%
See 2 more Smart Citations
“…The computational algorithm is briefly described here and full algorithmic details are provided elsewhere (Jarvis-Wloszek, 2003;Jarvis-Wloszek et al, 2003;Tan and Packard, 2004;Jarvis-Wloszek et al, 2005;Tan, 2006;Topcu et al, 2007Topcu et al, , 2008. Lemma 1 is the main Lyapunov theorem used to compute lower bounds on β * .…”
Section: Region Of Attraction Estimationmentioning
confidence: 99%
“…This nonlinear short period model is of interest because the decoupling of the longitudinal modes is typically done using linearized models. Section 3 describes a computational procedure to estimate regions of attraction for polynomial systems (Jarvis-Wloszek, 2003;JarvisWloszek et al, 2003;Tan and Packard, 2004;Jarvis-Wloszek et al, 2005;Tan, 2006;Topcu et al, 2007Topcu et al, , 2008. This algorithm is applied in Section 4 to estimate regions of attractions for the open-loop short period dynamics and a closed-loop longitudinal GTM aircraft.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…With the Sprocedure multipliers, the above optimization program will be bilinear in the unknown polynomials (V appears both in the antecedent and consequent of the implications). To solve it, we adopt a two-stage technique of bilinear alternations, similar to the approaches used in [37,21,28]. While these approaches offer no guarantee of optimality, they are practically effective and relatively straightforward to implement.…”
Section: A Bilinear Inner Approximationmentioning
confidence: 99%
“…In general, SOS programming has had a large impact on the control theory community since its advent over a decade ago [80] and has been used to tackle a wide variety of problems including feedback control synthesis, safety verification and computation of regions of attraction, invariant sets, and reachable sets for a broad class of nonlinear and hybrid systems [105,49,87,28,2,46]. However, despite the wide acceptance of the SOS approach in the control and optimization communities, applications of the method considered in the literature typically involve systems of relatively modest dimension (approximately 5-10 states).…”
Section: Chaptermentioning
confidence: 99%