Publication

Measurement-based optimization of batch processes with terminal constraint

Carsten Welz
2007
EPFL thesis
Abstract

This thesis deals with dynamic optimization of batch processes, i.e. processes that are characterized by a finite time of operation and the frequent repetition of batches. The objective is to maximize the quantity of the desired product at final time while satisfying constraints during the batch (path constraints) and at final time (terminal constraints). The classical approach is to apply, in an open-loop fashion, input profiles that have been determined off-line using optimization. In practical applications, however, a conservative stand has to be taken since uncertainty is present, which may lead to constraint violations or non-optimal operation. Measurement-based optimization helps reduce this conservatism by using measurements to compensate for the effect of uncertainty. In order to achieve optimal operation, it has been proposed to track the necessary conditions of optimality (NCO). For the terminal cost optimization of batch processes, the NCO consist in four parts : Path constraints and path sensitivity conditions that have to be met during the batch, as well as terminal constraints and terminal sensitivity conditions that have to be met at final time. The intuitive approach is to handle the path conditions during the batch by using on-line measurements, and to implement the terminal conditions on a run-to-run basis since measurements of the terminal conditions are available off-line. However, run-to-run adaptation methods have two important disadvantages : i) Several runs are necessary to obtain optimal operation, and ii) within-run perturbations cannot be compensated. In this thesis, it is shown via a variational analysis of the NCO that meeting the constraint parts of the NCO is more important than meeting the sensitivity parts. Therefore, methods for steering the system toward the terminal constraints by using on-line measurements are examined in order to give priority to meeting the constraint-seeking conditions. This work proposes to track run-time references that lead to the constraints at final time. Thus, a two-time-scale methodology is proposed, where the task of meeting the active terminal constraints is addressed on-line using trajectory tracking, whilst pushing the sensitivities to zero is implemented on a run-to-run basis. Moreover, the use of Iterative Learning Control (ILC) to improve tracking is studied. Reference tracking is often accomplished with linear controllers of the PID type since they are widely accepted in industry and easy to implement. However, as batch processes operate over a wide region and are often highly nonlinear systems, tracking errors are inevitable. A possibility to reduce tracking errors is to use time-varying feedforward inputs. The feedforward inputs can be generated by using a process model, but the presence of model uncertainty can limit the performance. Instead of a process model, ILC uses error information from previous batches for computing the feedforward inputs iteratively. Since batch processes are often not reset to identical initial conditions, ILC schemes that provide a certain robustness to errors in initial conditions must be used, such as ILC with forgetting factor. In this work, a scheme that shifts the input of the previous run backward in time is proposed. The advantage of the input shift over the use of a forgetting factor is that, when the reference trajectory is constant and the system stable, the tracking error decreases with run time. In addition to a shift of the input, a shift of the error trajectory, which is known as anticipatory ILC, is also used. The foregoing methodological developments are illustrated by two case studies, a simulated semi-batch reactor and an experimental laboratory-scale batch distillation column. It is shown that meeting the terminal constraints is the most important optimality condition for the processes under study. Provided that selected composition measurements are available on-line, these measurements are used to steer the processes to the desired terminal constraints on product composition. In comparison to run-to-run optimization schemes, performance is improved from the first batch on, and within-run perturbations can be rejected.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related concepts (35)
Mathematical optimization
Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.
Constraint satisfaction problem
Constraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint satisfaction methods. CSPs are the subject of research in both artificial intelligence and operations research, since the regularity in their formulation provides a common basis to analyze and solve problems of many seemingly unrelated families.
Optimal control
Optimal control theory is a branch of mathematical optimization that deals with finding a control for a dynamical system over a period of time such that an objective function is optimized. It has numerous applications in science, engineering and operations research. For example, the dynamical system might be a spacecraft with controls corresponding to rocket thrusters, and the objective might be to reach the moon with minimum fuel expenditure.
Show more
Related publications (64)

Scalable constrained optimization

Maria-Luiza Vladarean

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...
EPFL2024

Quality-Constrained Encoding Optimization for Omnidirectional Video Streaming

Pascal Frossard, Roberto Gerson De Albuquerque Azevedo, Chaofan He

Omnidirectional video streaming is usually implemented based on the representations of tiles, where the tiles are obtained by splitting the video frame into several rectangular areas and each tile is converted into multiple representations with different r ...
Piscataway2023

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

Colin Neil Jones, Yuning Jiang, Bratislav Svetozarevic, Wenjie Xu

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...
New York2023
Show more
Related MOOCs (17)
Introduction to optimization on smooth manifolds: first order methods
Learn to optimize on smooth, nonlinear spaces: Join us to build your foundations (starting at "what is a manifold?") and confidently implement your first algorithm (Riemannian gradient descent).
IoT Systems and Industrial Applications with Design Thinking
The first MOOC to provide a comprehensive introduction to Internet of Things (IoT) including the fundamental business aspects needed to define IoT related products.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.