DocumentCode :
2564031
Title :
Feasibility, optimality and computational complexity of Robust Model Predictive Control
Author :
Ding, Baocang
Author_Institution :
Coll. of Autom., Chongqing Univ., Chongqing
fYear :
2008
fDate :
2-4 July 2008
Firstpage :
3052
Lastpage :
3057
Abstract :
For robust model predictive control (RMPC), many efforts have been taken on enlarging the region of attraction, enhancing the optimality and reducing the computational burden. For open-loop min-max MPC, it may be unable to enlarge the region of attraction by increasing the computational burden. Hence, an improvement of the initial optimization of the open-loop min-max MPC is specially given. By choosing the closed-loop optimal control, more on-line decision variables and larger optimization horizon, the feasibility and optimality can be improved but the computational burden may be intensified. However, promising strategies for improvement can be formulated by modifying the performance index, the type of invariant sets and control modes.
Keywords :
closed loop systems; computational complexity; minimax techniques; open loop systems; optimal control; predictive control; robust control; closed-loop optimal control; computational complexity; invariant set; online decision variable; open-loop min-max MPC; optimization; performance index; robust model predictive control; Automation; Computational complexity; Educational institutions; Electronic mail; Optimal control; Predictive control; Predictive models; Robust control; Sampling methods; Stability; Computational complexity; Model predictive control; Performance improvement; Region of attraction; Robust control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control and Decision Conference, 2008. CCDC 2008. Chinese
Conference_Location :
Yantai, Shandong
Print_ISBN :
978-1-4244-1733-9
Electronic_ISBN :
978-1-4244-1734-6
Type :
conf
DOI :
10.1109/CCDC.2008.4597887
Filename :
4597887
Link To Document :
بازگشت