1998
DOI: 10.1023/a:1021711402723
|View full text |Cite
|
Sign up to set email alerts
|

Application of Interior-Point Methods to Model Predictive Control

Abstract: We present a structured interior-point method for the e cient solution of the optimal control problem in model predictive control MPC . The cost of this approach is linear in the horizon length, compared with cubic growth for a naive approach. We use a discrete-time Riccati recursion to solve the linear equations e ciently at each iteration of the interior-point method, and show that this recursion is numerically stable. We demonstrate the e ectiveness of the approach b y applying it to three process control p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
395
0
1

Year Published

2006
2006
2023
2023

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 471 publications
(404 citation statements)
references
References 23 publications
1
395
0
1
Order By: Relevance
“…Nevertheless, the technique has also been adopted in many other fields such as automotive, medical and aerospace applications along with faster onboard computers and better quadratic programming (QP) solvers, e.g. (Rao, et al, 1998). The prosperous progress of the algorithm was aroused after a systematic analysis of the stability issues achieved by Mayne (2000).…”
Section: Model Predictive Control (Mpc) 23mentioning
confidence: 99%
“…Nevertheless, the technique has also been adopted in many other fields such as automotive, medical and aerospace applications along with faster onboard computers and better quadratic programming (QP) solvers, e.g. (Rao, et al, 1998). The prosperous progress of the algorithm was aroused after a systematic analysis of the stability issues achieved by Mayne (2000).…”
Section: Model Predictive Control (Mpc) 23mentioning
confidence: 99%
“…The future states can be kept as decision variables and the system dynamics can be incorporated into the problem by enforcing equality constraints (Rao, Wright, and Rawlings, 1998;Wright, 1993Wright, , 1996. In this case, for any arbitrary K, if we let θ := [x T v T ] T where…”
Section: Non-condensed Approachmentioning
confidence: 99%
“…The resulting banded matrix has a half-band of size 2n + m. Such a linear system can be solved using a banded LDL T factorization in N (2n+m) 3 +4N (2n+m) 2 +N (2n+m) flops (Boyd and Vandenberghe, 2004, App. C), or through a block factorization method based on a sequence of Cholesky factorizations in O(N (n + m) 3 ) operations (Rao, Wright, and Rawlings, 1998). The memory requirements can be approximated by the cost of storing matrices H, G, F and A k , which are all sparse.…”
Section: Non-condensed Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…They, respectively, work in the spaces of dimension n U −n c , n c , n U and n U + n c where n U is the number of optimisation variables and n c the number of constraints. In the literature of model predictive control, the primal methods have dominated the numerical solutions (see for example, ) until recent years specially tailored interior-point methods applicable to MPC have appeared (see, for example (Rao, Wright, and Rawlings, 1998)). These algorithms solve the constrained control problem by utilising the special structure of the control system.…”
Section: Practical Solution Of the Qpmentioning
confidence: 99%