2004
DOI: 10.1080/00207170310001655327
|View full text |Cite
|
Sign up to set email alerts
|

Interpolation based computationally efficient predictive control

Abstract: This paper investigates interpolation based predictive control and presents a study of the properties and therefore limitations of the approach. This understanding is used to develop an efficient algorithm with guarantees of recursive feasibility and stability.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
52
0
1

Year Published

2007
2007
2017
2017

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 53 publications
(53 citation statements)
references
References 13 publications
0
52
0
1
Order By: Relevance
“…Additionally, evaluation points can be introduced to evaluate the control variables at specific time instants and not over the entire prediction horizon [83]. Another approach that can be employed for complexity reduction is linear interpolation between precomputed predicted trajectories with desirable characteristics [97,98]. Each predicted trajectory is tuned to achieve different objectives, i.e., optimal performance or maximum feasibility.…”
Section: Modified On-line Mpc For Embedded Control Systemsmentioning
confidence: 99%
“…Additionally, evaluation points can be introduced to evaluate the control variables at specific time instants and not over the entire prediction horizon [83]. Another approach that can be employed for complexity reduction is linear interpolation between precomputed predicted trajectories with desirable characteristics [97,98]. Each predicted trajectory is tuned to achieve different objectives, i.e., optimal performance or maximum feasibility.…”
Section: Modified On-line Mpc For Embedded Control Systemsmentioning
confidence: 99%
“…Earlier proposals using just one d.o.f. gave limited feasibility gains or even non-convex feasibility regions [9] and thus, although useful at times, it was difficult to make any a priori statements.…”
Section: Gimpc2β: Reducing the Number Of Degrees Of Freedommentioning
confidence: 99%
“…A common objective in the MPC community is guaranteeing asymptotic stability and recursive constraint satisfaction for a set of initial states that is as large as possible and with both a minimal control cost and computational load. Interpolation techniques [9], [1] provide a favorable trade off between these different aspects. Typically there is a conflict existing between the computational efficiency, which depends on the number of d.o.f., the volume of the feasible region and the performance.…”
Section: Introductionmentioning
confidence: 99%
“…En Rossiter et al, 2004) esta solución se calcula para el caso en que las perturbaciones que afectan al sistema lleven al mismo a la región no factible. En ese caso, la solución óptima resulta no factible, por lo que, eventualmente, el algoritmo de control aplicará una interpolación entre la solución óptima LQ y la solución ML.…”
Section: Interpolación Lq+mlunclassified