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...
Saved in:
| Published in: | International journal of control Vol. 78; no. 18; pp. 1511 - 1520 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
London
Taylor & Francis Group
15.12.2005
Taylor & Francis |
| Subjects: | |
| ISSN: | 0020-7179, 1366-5820 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 |