Open-Loop Optimization Strategies for Additive Uncertainty

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The essential components of the classical predictive control algorithms considered in Chap. 2 also underpin the design of algorithms for robust MPC. Guarantees of closed-loop properties such as stability and convergence rely on appropriately defined terminal control laws, terminalsets and cost functions. Likewise, to ensure that constraints can be met in the future, the initial plant state must belong to a suitable controllable set. However the design of these constituents and the analysis of their effects on the performance of MPC algorithms become more complex in the case where the system dynamics are subject to uncertainty. The main difficulty is that properties such as invariance, controlled invariance (including recursive feasibility) and monotonicity of the predicted cost must be guaranteed for all possible uncertainty realizations. In many cases this leads to computation which grows rapidly with the problem size and the prediction horizon.

Cite

CITATION STYLE

APA

Kouvaritakis, B., & Cannon, M. (2016). Open-Loop Optimization Strategies for Additive Uncertainty. In Advanced Textbooks in Control and Signal Processing (pp. 67–119). Springer International Publishing. https://doi.org/10.1007/978-3-319-24853-0_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free