Dynamic self-optimizing control for unconstrained batch processes

Lingjian Ye

doi:10.1016/j.compchemeng.2018.06.024

Return

Dynamic self-optimizing control for unconstrained batch processes

2018-09-01

PRE

Lingjian Ye

Sigurd Skogestad *

DOI：10.1016/j.compchemeng.2018.06.024

Original

Original request for help

Save

Abstract

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.

Keywords:

Self-optimizing control

Controlled variable

Dynamic optimization

Batch process

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.