.png){kind=icon}
返回
Dynamic self-optimizing control for unconstrained batch processes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2018.06.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider near-optimal operation for a class of unconstrained batch processes using the self-optimizing control (SOC) methodology. The existing static SOC approach is extended to the dynamic case by means of a static reformulation of the dynamic optimization problem. However, the dynamic SOC problem is posed as a structure-constrained controlled variable (CV) selection problem, which is different from the static cases. A lower-block triangular structure is specified for the combination matrix, H, to allow for optimal operation whilst respecting causality. A new result is that the structure-constrained SOC problem still results in a convex formulation, which has an analytic solution where the optimal CVs associated with discrete time instants are solved separately. In addition, the inputs are directly determined based on current CV functions for on-line utilization. A fed-batch reactor and a batch distillation column are used to demonstrate the usefulness of the proposed approach. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Self-optimizing control
Controlled variable
Dynamic optimization
Batch process
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
NCO tracking and self-optimizing control in the context of real-time optimization实时优化背景下的NCO跟踪和自优化控制
PREAI
分享收藏Large-scale nonlinear programming using IPOPT: An integrating framework for enterprise-wide dynamic optimization使用IPOPT的大规模非线性规划: 企业范围动态优化的集成框架
PREAI
分享收藏
查看更多内容