2017 American Control Conference (ACC) 2017
DOI: 10.23919/acc.2017.7963735
|View full text |Cite
|
Sign up to set email alerts
|

Parameter-dependent stability conditions for quasi-LPV Model Predictive Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(19 citation statements)
references
References 7 publications
0
19
0
Order By: Relevance
“…We give the construction for c = ∞ in (11), as used in the numerical examples. The cost (11) can be implemented by introducing non-negative slack variables ( , , ). Then, wc (X i , K i , Θ i ) ≤ i is equivalent to ∀i ∈ [0..N − 1]:…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…We give the construction for c = ∞ in (11), as used in the numerical examples. The cost (11) can be implemented by introducing non-negative slack variables ( , , ). Then, wc (X i , K i , Θ i ) ≤ i is equivalent to ∀i ∈ [0..N − 1]:…”
Section: Discussionmentioning
confidence: 99%
“…Both the controllers presented here and in [10,11] make use of a scheduling map to take into account the relationship between the state and scheduling variables. Where [10] solves a sequence of LTV MPC problems at each time instant, the tube-based method that this paper proposes solves a single LP or QP which is, however, more complex than the problems solved in [10].…”
Section: Introductionmentioning
confidence: 99%
“…In this scenario, terminal state constraints would not lead to a reasonable implementation as far away set points (even without obstacles) would need a long horizon, even though dynamically there is no difference from the case in which the set point is close. This issue can be handled by exploiting the velocity algorithm, which establishes stability by using terminal constraints on the velocity vector alone, thereby increasing the size of the feasible set.…”
Section: Discussionmentioning
confidence: 99%
“…Stability is enforced by the offline solution of two LMI problems to obtain the terminal ingredients. The approach was later extended to consider parameter dependent terminal ingredients which can drastically reduce conservatism brought by the stability requirement . However, the offline optimization problem was given by a bilinear matrix inequality (BMI) problem, which is nonconvex and generally hard to solve, an algorithm akin to D ‐ K iteration from μ‐theory was disclosed.…”
Section: Introductionmentioning
confidence: 99%
“…Such method was extended and further formalized in (Cisneros & Werner, 2017a), where the reference tracking problem was embedded to the NP formulation. In (Cisneros & Werner, 2017b), parameterdependent stability conditions for these algorithms were presented. Finally, an alternative stabilizing tubebased formulation of such algorithm was seen in (Hanema et al, 2017b).…”
Section: Nonlinear Programming Methodsmentioning
confidence: 99%