Application of an explicit min-max MPC to a scaled laboratory process

被引:17
|
作者
de la Peña, DM [1 ]
Ramírez, DR [1 ]
Camacho, EF [1 ]
Alamo, T [1 ]
机构
[1] Univ Seville, Escuela Super Ingn, Dept Ingn Sistemas & Automat, Seville 41092, Spain
关键词
predictive control; minimax techniques; multi-parametric programming; piecewise linear controllers; uncertainty;
D O I
10.1016/j.conengprac.2004.12.008
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Min-max model predictive control (MMMPC) requires the on-line solution of a min-max problem, which can be computationally demanding. The piecewise affine nature of MMMPC has been proved for linear systems with quadratic performance criterion. This paper shows how to move most computations off-line obtaining the explicit form of this control law by means of a heuristic algorithm. These results are illustrated with an application to a scaled laboratory process with dynamics fast enough to preclude the use of numerical solvers. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1463 / 1471
页数:9
相关论文
共 50 条
  • [31] Global optimization method for Min-Max MPC based on Wiener and Hammerstein model
    Degachi, Hajer
    Chagra, Wassila
    Ksouri, Moufida
    2015 7TH INTERNATIONAL CONFERENCE ON MODELLING, IDENTIFICATION AND CONTROL (ICMIC), 2014, : 698 - 703
  • [32] Poisson-process limit laws yield Gumbel max-min and min-max
    Eliazar, Iddo
    Metzler, Ralf
    Reuveni, Shlomi
    PHYSICAL REVIEW E, 2019, 100 (02)
  • [33] Further studies on min-max MPC algorithm for LPV systems subject to inputsaturation
    Wang, Likui
    Liu, Juanjuan
    ICIC Express Letters, 2010, 4 (03): : 839 - 844
  • [34] Study on the application of min-max fuzzy neural network
    Zhou, Yue
    Xiang, Jinglin
    Yang, Jie
    Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2000, 13 (03): : 299 - 304
  • [35] Min-max timing analysis and an application to asynchronous circuits
    Chakraborty, S
    Dill, DL
    Yun, KY
    PROCEEDINGS OF THE IEEE, 1999, 87 (02) : 332 - 346
  • [36] A MIN-MAX THEOREM FOR GRAPHS WITH APPLICATION TO GRAPH COLORING
    MATULA, DW
    SIAM REVIEW, 1968, 10 (04) : 481 - &
  • [37] Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems
    Aissi H.
    4OR, 2006, 4 (4) : 347 - 350
  • [38] Min-max and max-min graph saturation parameters
    Sudha, S.
    Arumugam, S.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 943 - 947
  • [39] Approximation of min-max and min-max regret versions of some combinatorial optimization problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 281 - 290
  • [40] On min-max cycle bases
    Galbiati, G
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 116 - 123