Loading [a11y]/accessibility-menu.js
On the complexity of explicit MPC laws | IEEE Conference Publication | IEEE Xplore

On the complexity of explicit MPC laws


Abstract:

Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model P...Show More

Abstract:

Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive Control requires the online solution of such QPs. This can be obtained by using a QP solver or evaluating the associated explicit solution. Objective of this note is to shed some light on the complexity of the two approaches.
Date of Conference: 23-26 August 2009
Date Added to IEEE Xplore: 02 April 2015
Print ISBN:978-3-9524173-9-3
Conference Location: Budapest, Hungary

References

References is not available for this document.