SCI和EI收录∣中国化工学会会刊

Chin.J.Chem.Eng. ›› 2015, Vol. 23 ›› Issue (12): 2087-2091.DOI: 10.1016/j.cjche.2015.10.008

Previous Articles     Next Articles

A fast MPC algorithm for reducing computation burden of MIMO

Rongbin Qi, Hua Mei, Chao Chen, Feng Qian   

  1. Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China
  • Received:2015-06-03 Revised:2015-07-29 Online:2016-01-19 Published:2015-12-28
  • Contact: Rongbin Qi, Hua Mei
  • Supported by:

    Supported by the National Natural Science Foundation of China (61333010, 61203157), the Fundamental Research Funds for the Central Universities, the National High-Tech Research and Development Program of China (2013AA040701), Shanghai Natural Science Foundation Project (15ZR1408900), and Shanghai Key Technologies R&D Program Project (13111103800).

A fast MPC algorithm for reducing computation burden of MIMO

Rongbin Qi, Hua Mei, Chao Chen, Feng Qian   

  1. Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China
  • 通讯作者: Rongbin Qi, Hua Mei
  • 基金资助:

    Supported by the National Natural Science Foundation of China (61333010, 61203157), the Fundamental Research Funds for the Central Universities, the National High-Tech Research and Development Program of China (2013AA040701), Shanghai Natural Science Foundation Project (15ZR1408900), and Shanghai Key Technologies R&D Program Project (13111103800).

Abstract: The computation burden in themodel-based predictive control algorithmis heavywhen solving QR optimization with a limited sampling step, especially for a complicated system with large dimension. A fast algorithm is proposed in this paper to solve this problem, inwhich real-time values are modulated to bit streams to simplify the multiplication. In addition, manipulated variables in the prediction horizon are deduced to the current control horizon approximately by a recursive relation to decrease the dimension of QR optimization. The simulation results demonstrate the feasibility of this fast algorithm for MIMO systems.

Key words: Fast MPC algorithm, Computation burden, One-bit operation, Dimension reduction

摘要: The computation burden in themodel-based predictive control algorithmis heavywhen solving QR optimization with a limited sampling step, especially for a complicated system with large dimension. A fast algorithm is proposed in this paper to solve this problem, inwhich real-time values are modulated to bit streams to simplify the multiplication. In addition, manipulated variables in the prediction horizon are deduced to the current control horizon approximately by a recursive relation to decrease the dimension of QR optimization. The simulation results demonstrate the feasibility of this fast algorithm for MIMO systems.

关键词: Fast MPC algorithm, Computation burden, One-bit operation, Dimension reduction