Comments on "quasi-min-max MPC algorithm for LPV systems" by Y. Lu and Y. Arkun, Automatica 36 (2000) 527-540

被引：2

作者：

Cao, YY ^{[1
]}

Xue, AK

机构：

[1] Zhejiang Univ, Dept Control, Hangzhou 310027, Peoples R China

[2] Hangzhou Inst Elect Engn, Dept Automat, Hangzhou 310037, Peoples R China

来源：

AUTOMATICA | 2004年 / 40卷 / 07期

关键词：

model predictive control; min-max MPC algorithm;

D O I：

10.1016/j.automatica.2003.10.026

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This note shows that the solvability of the modified quasi-min-max MPC algorithm of the paper Lu and Arkun, Automatica 36 (2000) 527 for the systems with input constraints is not guaranteed and the proof of the theorems are not sufficient via a counterexample of the Remark 5. (C) 2004 Elsevier Ltd. All rights reserved.

引用

页码：1281 / 1282

页数：2