Stochastic Model Predictive Control: Tractability and constraint satisfaction
- đ¤ Speaker: Professor John Lygeros (Head of the Automatic Control Laboratory, ETH Zurich)
- đ Date & Time: Tuesday 01 December 2009, 16:00 - 17:00
- đ Venue: Cambridge University Engineering Department, Lecture Room 5
Abstract
Exploiting advances in optimization, especially convex and multi-parametric optimization, model predictive control (MPC) for deterministic systems has matured into a powerful methodology with a wide range of applications. Recent activity in robust optimization has also enabled the formulation and solution of robust MPC problems for systems subject to various kinds of worst case uncertainty. For systems subject to stochastic uncertainty, however, the formulation and solution of MPC problems still poses fundamental conceptual challenges. Optimization over open loop controls, for example, tends to lead to excessively conservative solutions, so optimization over an appropriate class of feedback policies is often necessary. As in the case of robust MPC , the selection of policies one considers is crucial and represents a trade-off between the tractability of the optimization problem and the optimality of the solution. Moreover, in the presence of stochastic disturbances hard state and input constraints need to be re-interpreted as chance constraints, or integrated chance constraints, which may be violated with a certain tolerance. This interpretation, however, makes it difficult to enforce hard input constraints dictated by the capabilities of the system and the actuators, especially if one considers desirable classes of feedback policies such as affine policies. And what guarantees can one provide in the infinite horizon case, given that the system evolution is obtained by solving an infinite sequence of finite horizon problems each of which may violate its constraints with a finite probability? This talk will outline these challenges and propose solutions for some. The resulting stochastic MPC methods will be illustrated on benchmark problems and compared with alternatives.
Series This talk is part of the CUED Control Group Seminars series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Cambridge University Engineering Department, Lecture Room 5
- Cambridge University Engineering Department Talks
- Centre for Smart Infrastructure & Construction
- Chris Davis' list
- Computational Continuum Mechanics Group Seminars
- CUED Control Group Seminars
- Featured lists
- Information Engineering Division seminar list
- Interested Talks
- ndk22's list
- ob366-ai4er
- Probabilistic Systems, Information, and Inference Group Seminars
- rp587
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Tuesday 01 December 2009, 16:00-17:00