Feasibility, Stability, Convergence and Markov Chains

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

Abstract

This chapter considers the closed-loop properties of stochastic MPC strategies based on the predicted costs and probabilistic constraints formulated in Chap. 6. To make the analysis of closed-loop stability and performance possible, it must first be ensured that the MPC law is well-defined at all times and the most natural way to approach this is to ensure that the associated receding horizon optimization problem remains feasible whenever it is initially feasible. We therefore begin by discussing the conditions for recursive feasibility.

Cite

CITATION STYLE

APA

Kouvaritakis, B., & Cannon, M. (2016). Feasibility, Stability, Convergence and Markov Chains. In Advanced Textbooks in Control and Signal Processing (pp. 271–301). Springer International Publishing. https://doi.org/10.1007/978-3-319-24853-0_7

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