Return to search

Strategies in robust and stochastic model predictive control

The presence of uncertainty in model predictive control (MPC) has been accounted for using two types of approaches: robust MPC (RMPC) and stochastic MPC (SMPC). Ideal RMPC and SMPC formulations consider closed-loop optimal control problems whose exact solution, via dynamic programming, is intractable for most systems. Much effort then has been devoted to find good compromises between the degree of optimality and computational tractability. This thesis expands on this effort and presents robust and stochastic MPC strategies with reduced online computational requirements where the conservativeness incurred is made as small as conveniently possible. Two RMPC strategies are proposed for linear systems under additive uncertainty. They are based on a recently proposed approach which uses a triangular prediction structure and a non-linear control policy. One strategy considers a transference of part of the computation of the control policy to an offline stage. The other strategy considers a modification of the prediction structure so that it has a striped structure and the disturbance compensation extends throughout an infinite horizon. An RMPC strategy for linear systems with additive and multiplicative uncertainty is also presented. It considers polytopic dynamics that are designed so as to maximize the volume of an invariant ellipsoid, and are used in a dual-mode prediction scheme where constraint satisfaction is ensured by an approach based on a variation of Farkas' Lemma. Finally, two SMPC strategies for linear systems with additive uncertainty are presented, which use an affine-in-the-disturbances control policy with a striped structure. One strategy considers an offline sequential design of the gains of the control policy, while these are variables in the online optimization in the other. Control theoretic properties, such as recursive feasibility and stability, are studied for all the proposed strategies. Numerical comparisons show that the proposed algorithms can provide a convenient compromise in terms of computational demands and control authority.

Identiferoai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:669725
Date January 2014
CreatorsMunoz Carpintero, Diego Alejandro
ContributorsKouvaritakis, Basil ; Cannon, Mark
PublisherUniversity of Oxford
Source SetsEthos UK
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Sourcehttp://ora.ox.ac.uk/objects/uuid:2f6bce71-f91f-4d5a-998f-295eff5b089a

Page generated in 0.0771 seconds