An algorithm for reducing complexity in parametric predictive control

Multi parametric quadratic programming solutions to predictive control can require large numbers of regions which would make practical implementation difficult. This paper demonstrates how an underexplored prediction class can be combined with parametric programming to give far simpler solutions and...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of control Ročník 78; číslo 18; s. 1511 - 1520
Hlavní autori:	Rossiter, J. A., Kouvaritakis, B., Cannon, M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis Group 15.12.2005 Taylor & Francis
Predmet:	Applied sciences Computer science; control theory; systems Control system analysis Control system synthesis Control theory. Systems Exact sciences and technology Miscellaneous Algorithm Parametric programming Prediction Predictive control
ISSN:	0020-7179, 1366-5820
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	Multi parametric quadratic programming solutions to predictive control can require large numbers of regions which would make practical implementation difficult. This paper demonstrates how an underexplored prediction class can be combined with parametric programming to give far simpler solutions and at little cost to optimality. The key proposal is to explore how one can give more flexibility in the shape of the predictions without increasing the required numbers of degrees of freedom; this flexibility allows terminal regions to be enlarged.
ISSN:	0020-7179 1366-5820
DOI:	10.1080/00207170500368826