论文部分内容阅读
本文利用反向递推方法对广义预测控制（GPC）的准则函数进行变换，得出一种违推的快速GPC算法．该算法对预测长度为N的阶系统的计算量仅为O（N·n），优于传统的求解Dio－Phantine方程或矩阵求道的算法．仿真结果表明了算法的有效性．
In this paper, the inverse recursive method is used to transform the criterion function of generalized predictive control (GPC), and a fast GPC algorithm is deduced. The proposed algorithm only needs O (N · n) for the prediction of order N, and outperforms the traditional algorithm for solving Dio-Phantine equations or matrices. Simulation results show the effectiveness of the algorithm.