Robust Optimization for MPC

  • Houska B
  • Villanueva M
N/ACitations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter aims to give a concise overview of numerical methods and algorithms for implementing robust model predictive control (MPC). We introduce the mathematical problem formulation and discuss convex approximations of linear robust MPC as well as numerical methods for nonlinear robust MPC. In particular, we review and compare generic approaches based on min-max dynamic programming and scenario-trees as well as Tube MPC based on set-propagation methods. As this chapter has a strong focus on numerical methods and their practical implementation, we also review a number of existing software packages for set computations, which can be used as building blocks for the implementation of robust MPC solvers.

Cite

CITATION STYLE

APA

Houska, B., & Villanueva, M. E. (2019). Robust Optimization for MPC (pp. 413–443). https://doi.org/10.1007/978-3-319-77489-3_18

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