• DocumentCode
    1123078
  • Title

    Fast Model Predictive Control Using Online Optimization

  • Author

    Wang, Yang ; Boyd, Stephen

  • Author_Institution
    Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
  • Volume
    18
  • Issue
    2
  • fYear
    2010
  • fDate
    3/1/2010 12:00:00 AM
  • Firstpage
    267
  • Lastpage
    278
  • Abstract
    A widely recognized shortcoming of model predictive control (MPC) is that it can usually only be used in applications with slow dynamics, where the sample time is measured in seconds or minutes. A well-known technique for implementing fast MPC is to compute the entire control law offline, in which case the online controller can be implemented as a lookup table. This method works well for systems with small state and input dimensions (say, no more than five), few constraints, and short time horizons. In this paper, we describe a collection of methods for improving the speed of MPC, using online optimization. These custom methods, which exploit the particular structure of the MPC problem, can compute the control action on the order of 100 times faster than a method that uses a generic optimizer. As an example, our method computes the control actions for a problem with 12 states, 3 controls, and horizon of 30 time steps (which entails solving a quadratic program with 450 variables and 1284 constraints) in around 5 ms, allowing MPC to be carried out at 200 Hz.
  • Keywords
    control engineering computing; optimisation; predictive control; table lookup; lookup table; model predictive control; online optimization; slow dynamics; Model predictive control (MPC); real-time convex optimization;
  • fLanguage
    English
  • Journal_Title
    Control Systems Technology, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1063-6536
  • Type

    jour

  • DOI
    10.1109/TCST.2009.2017934
  • Filename
    5153127