首页> 外文会议>IFAC world congress >NEURAL NETWORK BASED ON-LINE RE-OPTIMISATION OF FED-BATCH PROCESSES USING ITERATIVE DYNAMIC PROGRAMMING FOR DISCRETE-TIME SYSTEMS
【24h】

NEURAL NETWORK BASED ON-LINE RE-OPTIMISATION OF FED-BATCH PROCESSES USING ITERATIVE DYNAMIC PROGRAMMING FOR DISCRETE-TIME SYSTEMS

机译:基于神经网络的基于对批量流程的基于离散时间系统的迭代动态规划

获取原文

摘要

Optimisation of fed-batch processes can be described as a constrained nonlinear end-point dynamic optimisation problem. Although iterative dynamic programming (IDP) is feasible, it is usually very time-consuming and very difficult to apply to on-line optimisation because of solving the non-linear differential-algebraic equations of the process model in each iteration. The replacement of a rigorous mechanistic model by an equivalent neural network (NN) model takes the advantage of high speed processing, since simulation with a NN model involves only a few non-iterative algebraic calculations. To use IDP algorithm for NN model based on-line re-optimisation, a modified algorithm is proposed and is called as iterative dynamic programming for discrete-time system (IDPIDTS). The novel IDPIDTS algorithm can obtain a reduction of many times in computational time compared to the conventional IDP algorithm. In this paper, an effective optimisation and control scheme for on-line re-optimisation of fed-batch processes is proposed based on NN models and the novel IDP/DTS algorithm. The proposed scheme is illustrated using simulation studies of an ethanol fermentation process.
机译:可以将FED批处理过程的优化描述为约束的非线性终点动态优化问题。虽然迭代动态编程(IDP)是可行的,但由于在每次迭代中求解过程模型的非线性差分 - 代数方程,通常非常耗时,并且很难应用于在线优化。通过相同的神经网络(NN)模型更换严格的机制模型,采用高速处理的优点,因为利用NN模型的模拟涉及几个非迭代代数计算。为了使用基于NN模型的IDP算法基于线路重新优化,提出了一种修改的算法,称为用于离散时间系统(IDPIDT)的迭代动态编程。与传统IDP算法相比,新颖的IDPIDTS算法可以在计算时间中获得许多次数的减少。本文基于NN模型和新颖的IDP / DTS算法,提出了一种有效优化和控制FED批处理的在线重新优化的控制方案。使用乙醇发酵过程的模拟研究说明所提出的方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号