2002
DOI: 10.3182/20020721-6-es-1901.00600
|View full text |Cite
|
Sign up to set email alerts
|

Complexity Reduction in Explicit Linear Model Predictive Control

Abstract: Explicit piecewise linear (PWL) state feedback solutions to constrained linear model predictive control (MPC) problems can be obtained by solving multi-parametric quadratic programs (mp-QP) where the parameters are the components of the state vector. This allows MPC to be implemented via a PWL function evaluation without real-time optimization. The main drawback of this approach is dramatic increase in off-line computational complexity and number of regions in the state space partition as the number of states,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2004
2004
2022
2022

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 72 publications
(50 citation statements)
references
References 14 publications
(27 reference statements)
0
50
0
Order By: Relevance
“…These researchers suggested an orthogonal searching tree with will only partially solve the QPs, which -will terminate with a continuous piecewise linear (PWL) function that is an approximation to the continuous PWL exact solution‖ (Johansen and Grancharova, 2003). The block MPC method as mentioned in (Tøndel and Johansen, 2002) can also be combined to further decrease the searching effort. To further narrow down the online searching, (Pannocchia, et al, 2007) proposed a partial enumeration approach, where only relevant critical regions are calculated and stored in the memory.…”
Section: Approximate Methods Based Empcmentioning
confidence: 99%
See 1 more Smart Citation
“…These researchers suggested an orthogonal searching tree with will only partially solve the QPs, which -will terminate with a continuous piecewise linear (PWL) function that is an approximation to the continuous PWL exact solution‖ (Johansen and Grancharova, 2003). The block MPC method as mentioned in (Tøndel and Johansen, 2002) can also be combined to further decrease the searching effort. To further narrow down the online searching, (Pannocchia, et al, 2007) proposed a partial enumeration approach, where only relevant critical regions are calculated and stored in the memory.…”
Section: Approximate Methods Based Empcmentioning
confidence: 99%
“…The most notable work on this subject include studies of the EMPC method proposed in (Bemporad, et al, 2002) and (Tøndel and Johansen, 2002). Such a method solves all the possible solutions raised in the QP problem beforehand by solving a multi-parametric QP (mpQP) problem.…”
Section: Explicit Mpc (Empc)mentioning
confidence: 99%
“…The complexity is further reduced by implementing control input trajectory parameterization as it is described in [13]. The idea is to use an input trajectory parameterization with less degrees of freedom in order to reduce the dimension of the optimization problem.…”
Section: Approximate Mp-qp Algorithmmentioning
confidence: 99%
“…A linearized model can be obtained from the existing non-linear model: In order to avoid the steady state offset of the model predictive controller, two more states are added to the model (13), which take into account the integral error: 4 Real-time performance of explicit model predictive controller for the gas-liquid separation plant…”
Section: Model Of the Gas-liquid Separation Plantmentioning
confidence: 99%
“…In order to deal with this issue, it is common practice to reduce the degrees of freedom by fixing the input or its derivatives to be constant over several time-steps (e.g. [8], [9]). Although this alleviates the computational restrictions, the resulting control policies do not guarantee stability or constraint satisfaction.…”
Section: Introductionmentioning
confidence: 99%