Robust stability of min-max MPC controllers for nonlinear systems with bounded uncertainties

Sixteenth International Symposium on Mathematical Theory of Networks and Systems 05/07/2004 Leuven, BélgicaThe closed loop formulation of the robust MPC has been shown to be a control technique capable of robustly stabilize uncertain nonlinear systems subject to constraints. Robust asymptotic stability of these controllers has been proved when the uncertainties are decaying. In this paper we extend the existing results to the case of uncertainties that decay with the state but do not tend to zero. This allows us to consider both plant uncertainties and external disturbances in a less conservative way. First, we provide some results on robust stability under the considered kind of uncertainties. Based on these, we prove robust stability of the min-max MPC. In the paper we show how the robust design of the local controller is translated to the min-max controller and how the persistent term of the uncertainties determines the convergence rate of the closed-loop system.Ministerio de Ciencia y Tecnología DPI-2001-2380-03-01Ministerio de Ciencia y Tecnología DPI-2002-4375-C02-0

Robust Model Predictive Control via Scenario Optimization

This paper discusses a novel probabilistic approach for the design of robust model predictive control (MPC) laws for discrete-time linear systems affected by parametric uncertainty and additive disturbances. The proposed technique is based on the iterated solution, at each step, of a finite-horizon optimal control problem (FHOCP) that takes into account a suitable number of randomly extracted scenarios of uncertainty and disturbances, followed by a specific command selection rule implemented in a receding horizon fashion. The scenario FHOCP is always convex, also when the uncertain parameters and disturbance belong to non-convex sets, and irrespective of how the model uncertainty influences the system's matrices. Moreover, the computational complexity of the proposed approach does not depend on the uncertainty/disturbance dimensions, and scales quadratically with the control horizon. The main result in this paper is related to the analysis of the closed loop system under receding-horizon implementation of the scenario FHOCP, and essentially states that the devised control law guarantees constraint satisfaction at each step with some a-priori assigned probability p, while the system's state reaches the target set either asymptotically, or in finite time with probability at least p. The proposed method may be a valid alternative when other existing techniques, either deterministic or stochastic, are not directly usable due to excessive conservatism or to numerical intractability caused by lack of convexity of the robust or chance-constrained optimization problem.Comment: This manuscript is a preprint of a paper accepted for publication in the IEEE Transactions on Automatic Control, with DOI: 10.1109/TAC.2012.2203054, and is subject to IEEE copyright. The copy of record will be available at http://ieeexplore.ieee.or

An Improved Constraint-Tightening Approach for Stochastic MPC

The problem of achieving a good trade-off in Stochastic Model Predictive Control between the competing goals of improving the average performance and reducing conservativeness, while still guaranteeing recursive feasibility and low computational complexity, is addressed. We propose a novel, less restrictive scheme which is based on considering stability and recursive feasibility separately. Through an explicit first step constraint we guarantee recursive feasibility. In particular we guarantee the existence of a feasible input trajectory at each time instant, but we only require that the input sequence computed at time $k$ remains feasible at time $k+1$ for most disturbances but not necessarily for all, which suffices for stability. To overcome the computational complexity of probabilistic constraints, we propose an offline constraint-tightening procedure, which can be efficiently solved via a sampling approach to the desired accuracy. The online computational complexity of the resulting Model Predictive Control (MPC) algorithm is similar to that of a nominal MPC with terminal region. A numerical example, which provides a comparison with classical, recursively feasible Stochastic MPC and Robust MPC, shows the efficacy of the proposed approach.Comment: Paper has been submitted to ACC 201

Robustly stable feedback min-max model predictive control

Published versio

State feedback policies for robust receding horizon control: uniqueness, continuity, and stability

Published versio