Abstract
A model predictive control algorithm based on offline optimization of prediction dynamics enables an efficient online computation. However, the price for this efficiency is a reduction in the degree of optimality. This article presents a new method for overcoming this weakness, yielding a significant improvement in the degree of optimality, and achieving this with no increase in an online computational load. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed algorithm.
| Original language | English |
|---|---|
| Article number | 9027879 |
| Pages (from-to) | 383-390 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 66 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2021 |
| Externally published | Yes |
Keywords
- Cost function
- linear matrix inequalities
- optimal control
- predictive control
- uncertain systems