一种新型线性约束系统预测控制算法

通过对无约束预测控制算式的修正,应用线性规划求解技术,提出了一种基于脉冲响应模型的线性约束系统的预测控制算法。理论特性分析表明,该方法在一般情况下具有与无约束预测控制算法相同的稳定性和鲁棒性。以蒸馏塔质量控制为例进行了控制仿真,结果表明,这种新的预测控制算法不仅能满足系统存在的线性约束条件,而且有着比无约束预测控制和最优状态反馈控制更好的控制响应;与二次规划等优化算法比较,这种新的预测控制算法计算效率更高,能更好地满足生产过程实时控制需要。     

乙烯脱丁烷塔智能操作优化方法研究

考虑乙烯生产过程中实时操作优化特点,在建立精馏塔严格机理开放式方程优化模型的基础上,提出了基于简约空间序列二次规划(RSQP)算法的精馏塔智能操作优化方法.该法根据精馏塔优化操作的实际性和实时性要求,对简约空间SQP算法进行了一些特殊处理,对收敛条件加入了一些智能化规则,使得优化算法综合考虑优化效益、优化求解时间和质量约束等方面.计算结果表明该法的计算效率高于基于Snopt和一般简约空间SQP算法的精馏塔操作优化方法,并且该方法更符合实时操作优化的要求.     

基于自适应粒子群优化算法的预测控制算法及其在加热炉支管平衡中的应用

多变量和输出受限系统的预测控制问题一般表现为一个不易直接求解的多变量且多约束的非线性动态规划问题.传统优化方法在解决此优化问题时,存在易收敛到非法解或局部极小、计算时间长以及对模型参数与初值依赖性强的缺点.提出了一种基于自适应粒子群优化的预测控制算法(APSO-DMC),采用自适应粒子群优化算法(APSO)作为模型预测控制的优化方法,在线实时求解最优控制律,从而有效地克服了传统优化方法的不足.将此算法应用于常减压装置加热炉支管温度平衡控制中,仿真试验结果显示了该方法的有效性.     

线性规划实现动态优化的模型预测控制策略

为减小模型预测控制算法中动态优化部分的计算复杂度,提出了用线性规划而非二次规划解决模型预测控制动态优化方法。对单输入单输出和多输入多输出模型预测控制的情形,以控制增量、输出增量和偏移变量作为优化变量,建立线性等式约束和不等式约束,并引入线性目标函数,形成线性规划问题。通过加入多种软约束,可改善动态过程的性能指标,达到平稳控制的目的。最后通过一个实例验证了方法的有效性。     

快速增量约束预测控制及在GLCC液位控制中的应用

针对气-液柱状旋流式(GLCC)多相流量计的液位控制问题,提出一种增量多变量模型预测控制(MPC)算法。采用控制增量状态空间模型和阶梯式控制策略,建立约束多变量MPC优化控制问题。为在线计算约束优化问题,引入坐标轮换法和黄金分割法,在线计算控制变量增量值,进而得到预测控制量。最后,以GLCC多相流量计的两输入单输出液位控制模型为例,仿真验证本文算法的有效性。     

差分进化在基于非线性规划的多项式PLS中的应用

从应用的角度提出一种基于带约束非线性规划的多项式偏最小二乘算法(QPLS),利用差分进化算法(DE)计算最优输入权值和内部关系式的最优参数.在对常压塔常三线柴油凝点的软测量模型应用结果表明,该算法与基于传统优化算法进行参数优化的多项式QPLS相比,模型拟合精度高,且对初值的依赖性小,并具有良好的预报能力.     

基于KPLS模型的间歇过程产品质量控制

针对间歇过程所具有的非线性特性,提出了一种基于核偏最小二乘(KPLS)模型的最终产品质量控制策略。利用初始条件、批次展开后的过程数据以及最终产品质量建立了间歇过程的KPLS模型;采用基于主成分分析(PCA)映射的预估方法对未知的过程数据进行补充,实现了最终产品质量的在线预测。为了解决最终产品质量的控制,利用T2统计量确定KPLS模型的适用范围,并作为约束引入产品质量控制问题,提高控制策略的可行性;采用粒子群优化(PSO)算法实现了优化问题的高效求解。仿真结果表明,与基于偏最小二乘(PLS)模型的控制策略相比,所提出的方法具有更高的预测精度,且能有效解决产品质量控制中出现的各种问题。     

阶梯式多变量DMC分散优化算法及工程化实现

提出基于状态空间模型的阶梯式多变量动态矩阵控制分散优化算法,使计算量大大减少,并在自行研制的先进控制平台上,实现了这种算法.该算法的工程化实现方法,使用户可以方便地构建自动控制系统并实施多变量动态矩阵控制.对双容水箱的控制实验表明,该控制算法对具有多变量、时滞、耦合和不确定性的复杂对象,具有良好的控制效果.     

过程预测控制中约束可行性研究与在线调整

化工过程控制中,普遍存在着各种对输入和输出变量的约束条件。系统与约束之间的矛盾有可能造成约束预测控制的优化问题不可行,为生产带来负面影响。基于线性系统离散状态空间的动态模型,从凸多面体距离角度,对有约束预测控制的可行性分析和不可行时的约束处理问题进行讨论,提出在每步求解约束预测控制律之前进行必要的可行性分析和合理的约束调整的在线滚动算法,从而使约束条件在整个时域得到满足,并且保证系统的控制性能。通过CSTR模型的控制仿真实验证明了该算法的有效性。     

基于改进回声状态网络的游离氧化钙预测控制

在非线性时延水泥烧成系统中,针对传统预测控制方法调节时间长、控制精度不高的问题,提出一种改进的在线型回声状态网络预测控制模型。首先将带有L1范数约束项的递归最小二乘法与回声状态网络相结合构建在线型预测模型,解决传统预测控制模型辨识精度较低、无法进行实时预测的问题;然后基于改进的回声状态网络预测模型,构建预测控制模型结构,并采用具有全局优化能力的粒子群算法进行滚动优化,保证实际输出量快速、准确、平稳地跟随被控量的设定值;最后利用改进的预测控制模型对水泥烧成系统中的游离氧化钙含量进行预测控制仿真实验,结果表明改进的预测控制模型具有良好的性能和应用前景。     

Generic model controller tuning for chemical processes with input saturation

Control in the face of process input constraints is very common and of great practical importance in the processing industries. Generic Model Control (GMC) is a model‐based control framework for both linear and nonlinear systems. In this paper, a constrained GMC controller tuning approach using a nonlinear least squares technique is proposed. This tuning approach is simple to apply. For a SISO GMC control system with input saturation, the tracking performance is significantly improved by adding a simple heuristic switching strategy. The effectiveness of the proposed controller tuning approach is demonstrated using dynamic simulations and MIMO real‐time experiments.     

AN ADAPTIVE STRATEGY FOR CONSTRAINED GENERIC MODEL CONTROL

The performance of control systems on industrial processes is often constrained—constraints on the process inputs and outputs. Effective control algorithms must be cognizant of the presence of these constraints. Generic Model Control (GMC) is a model-based control framework for both linear and nonlinear systems without explicit constraint handling. In this paper, it is shown that an adaptive approach can be incorporated within GMC to accommodate the constraints by adapting one of the two GMC parameters during the control procedure. Adaptation is determined to be necessary when the predicted process state and output variables as calculated by the process model violate their constrained values. The adaption is achieved through assessing the sensitivities of the constraints to the GMC parameters. Two non-linear examples are presented which demonstrate the efficiency of the approach.     

Generic model control — A case study revisited

The application of the Generic Model Control (GMC) algorithm to the control of an evaporator has been reported recently by Lee et al. (1989). The results of their case study are claimed to demonstrate the superiority of the nonlinear GMC algorithm over conventional techniques including Dynamic Matrix Control. In this note it is shown that for the evaporator example the improved performance arises primarily from the full multivariable and feedforward nature of the control law, rather than from the nonlinear nature of GMC.     

GENERIC MODEL ADAPTIVE CONTROL

Generic Model Control (GMC) is a process model based control algorithm incorporating a process model directly within the control structure. It has been shown to produce excellent control, despite reasonable modelling errors. In this paper an algorithm is developed within a GMC framework which reduces the effect of larger modelling errors by regularly updating the model parameters. This new adaptive algorithm is capable of adapting model parameters in a nonlinear model, where the parameters appear in a nonlinear manner. Several examples are presented to illustrate the principles of the technique.     

Explicit Nonlinear Predictive Control of a Distillation Column Based on Neural Models

A nonlinear Model Predictive Control (MPC) algorithm and its application to a distillation column are described. The algorithm uses a neural model of the process that is linearized online around the current operating point. The algorithm is computationally efficient because the control policy is calculated explicitly without any optimization. The algorithm requires online repetition of a matrix decomposition task and the solution of linear equations. The obtained solution is projected onto the admissible set of constraints imposed on the magnitude and the increment of the manipulated variables. For the distillation column considered, the control accuracy is comparable not only to that obtained in MPC with online linearization and quadratic programming but also to that obtained in nonlinear MPC, which is based on full nonlinear optimization repeated at each sampling instant.     

RELATIVE ORDER REDUCTION OF MULTIVARIABLE NONLINEAR PROCESSES FOR GENERIC MODEL CONTROL (GMC)

To be implemented within Generic Model Control, a process model must have a relative order of one. When systems have relative orders greater than one (“high relative order systems”) techniques are required to enable model based control to take place. In this paper, a relative order model reduction algorithm is presented, which reduces high relative order models to relative order one. The reduction algorithm is based on the singular perturbation model reduction method. The reduction method conserves some of the important linear qualities of the system, making implementation of the model within a nonlinear model based controller such as GMC attractive.     

Optimization of short-time gasoline blending scheduling problem with a DNA based hybrid genetic algorithm

Gasoline blending is a key process in the petroleum refinery industry posed as a nonlinear optimization problem with heavily nonlinear constraints. This paper presents a DNA based hybrid genetic algorithm (DNA-HGA) to optimize such nonlinear optimization problems. In the proposed algorithm, potential solutions are represented with nucleotide bases. Based on the complementary properties of nucleotide bases, operators inspired by DNA are applied to improve the global searching ability of GA for efficiently locating the feasible domains. After the feasible region is obtained, the sequential quadratic programming (SQP) is implemented to improve the solution. The hybrid approach is tested on a set of constrained nonlinear optimization problems taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm. The recipes of a short-time gasoline blending problem are optimized by the hybrid algorithm, and the comparison results show that the profit of the products is largely improved while achieving more satisfactory quality indicators in both certainty and uncertainty environment.     

PROCESS/MODEL MISMATCH COMPENSATION FOR MODEL-BASED CONTROLLERS

Process model-based control algorithms that employ a process model directly in the controller, have been shown to produce good control performance and robust behaviour, despite process modelling errors. However, when the process/model mismatch is large, the closed-loop response, while still being better than responses obtained by conventional controllers, will be degraded. This paper presents a new approach to compensate for process/model mismatch errors, and is based upon the Generic Model Control (GMC) algorithm. This approach is applicable to both linear and nonlinear model-based algorithms. Simulation results are presented to illustrate the efficiency of the approach     

ROBUST STABILITY ANALYSIS OF GENERIC MODEL CONTROL

In this paper, the robust stability of Generic Model Control (GMC) is analyzed under the condition that the explicit control law is available. This anslysis is performed by finding a strict Lyapunov function for the nominal process and applying a perturbation theorem. Based on the passivity theorem, a procedure to synthesize a robust stable GMC controller is proposed for a given set of processes. The significance of this approach is discussed as well as its disadvantages.     

Fast distributed MPC based on active set method

Modern chemical plants are characterized by their large-scale, strong interactions and the presence of constraints. With its ability to systematically handle these issues, distributed model predictive control (DMPC) is a promising approach for the control of such systems. However, the problem of how to efficiently solve the resulting distributed optimization problem is still an open question. This paper develops a novel fast DMPC approach based on a distributed active set method and offline inversion of the Hessian matrix to efficiently solve a constrained distributed quadratic program. A dual-mode optimization strategy based on the value of unconstrained optimal solution is developed to accelerate the computation of control action. The proposed method allows for the optimization to be terminated before convergence to cope with the fast sampling periods. Furthermore, a warm-start strategy based on the solution of the previous sampling instant is integrated with the approach to further improve convergence speed. The approach is highly parallelized as constraints can be checked in parallel. The approach is demonstrated using an academic example as well as a chemical process network control.