• DocumentCode
    1395147
  • Title

    Clipping-Based Complexity Reduction in Explicit MPC

  • Author

    Kvasnica, Michal ; Fikar, Miroslav

  • Author_Institution
    Slovak Univ. of Technol., Bratislava, Slovakia
  • Volume
    57
  • Issue
    7
  • fYear
    2012
  • fDate
    7/1/2012 12:00:00 AM
  • Firstpage
    1878
  • Lastpage
    1883
  • Abstract
    The idea of explicit model predictive control (MPC) is to characterize optimal control inputs as an explicit piecewise affine (PWA) function of the initial conditions. The function, however, is often too complex and either requires too much processing power to evaluate on-line, or consumes a prohibitive amount of memory. The paper focuses on the memory issue and proposes a novel method of replacing a generic continuous PWA function by a different function of significantly lower complexity in such a way that the simple function guarantees the same properties as the original. The idea is based on eliminating regions of the PWA function over which the function attains a saturated value. An extensive case study is presented which confirms that a significant reduction of complexity is achieved in general.
  • Keywords
    computational complexity; optimal control; piecewise linear techniques; predictive control; clipping-based complexity reduction; explicit MPC; explicit model predictive control; generic continuous PWA function; optimal control input; piecewise affine function; Complexity theory; Indexes; Memory management; Merging; Optimal control; Runtime; Vectors; Computational complexity; piecewise linear techniques; predictive control;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/TAC.2011.2179428
  • Filename
    6099563