2010
DOI: 10.1109/tac.2010.2047437
|View full text |Cite
|
Sign up to set email alerts
|

Polytopic Approximation of Explicit Model Predictive Controllers

Abstract: Abstract-A model predictive control law (MPC) isgiven by the solution to a parametric optimization problem that can be pre-computed offline, which provides an explicit map from state to input that can be rapidly evaluated online. However, the primary limitations of these optimal 'explicit solutions' are that they are applicable to only a restricted set of systems and that the complexity can grow quickly with problem size. In this paper we compute approximate explicit control laws that trade-off complexity agai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
51
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 97 publications
(52 citation statements)
references
References 31 publications
0
51
0
Order By: Relevance
“…for all x ∈ R. Proof: Follows as consequence ofû(x) expressed as an interpolation by barycentric coordinates [10], [26]. Lemma 2 leads us to the following result.…”
Section: A Stability Guarantees Of Approximate Controllersmentioning
confidence: 85%
“…for all x ∈ R. Proof: Follows as consequence ofû(x) expressed as an interpolation by barycentric coordinates [10], [26]. Lemma 2 leads us to the following result.…”
Section: A Stability Guarantees Of Approximate Controllersmentioning
confidence: 85%
“…The -optimal‖ solution also includes the consideration of online computation time frame, memory size and performance. In ) and (Jones and Morari 2010), direct approximations for inner and/or outer polytopic convex sets are applied to pre-specify the number of pieces in an EMPC problem. Also, an input to state stability approach is developed in Genuit, et al (2012) so the approximation errors can be bounded to preserve the closed-loop stability of the approximation method.…”
Section: Approximate Methods Based Empcmentioning
confidence: 99%
“…We define the j-th iteration cost as the cost (12) of the j-th trajectory at time t = 0, Finally we define the, barycentric function (Jones and Morari (2010))…”
Section: Terminal Costmentioning
confidence: 99%