Validation of a Solution Model for the Optimization of a Binary Batch Distillation Column
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.
We present results of molecular dynamics simulations performed on a Lennard-Jones liquid binary mixture confined in matrices of soft spheres at increasing packing fraction. We study the dynamical properties of the liquid at a given density upon supercoolin ...
Run-to-run control is a technique that exploits the repetitive nature of processes to iteratively adjust the inputs and drive the run-end outputs to their reference values. It can be used to control both static and finite-time dynamic systems. Although the ...
The operation of dynamic processes can be optimized using models that predict the system behavior well, in particular its optimality features. In practice, however, process models are often structurally inaccurate, and on-line adaptation is typically requi ...
We study the convergence of Markov decision processes, composed of a large number of objects, to optimization problems on ordinary differential equations. We show that the optimal reward of such a Markov decision process, which satisfies a Bellman equation ...
Institute of Electrical and Electronics Engineers2012
Dynamic programming is an algorithmic technique to solve problems that follow the Bellman’s principle: optimal solutions depends on optimal sub-problem solutions. The core idea behind dynamic programming is to memoize intermediate results into matrices to ...
Dynamic optimization can be used to determine optimal input profiles for dynamic processes. Due to plant-model mismatch and disturbances, the optimal inputs determined through model-based optimization will, in general, not be optimal for the plant. Modifie ...
The context of this paper is the use of process measurements to optimize batch processes in the presence of uncertainty. The optimal solution consists of (i) keeping certain path and terminal constraints active and (ii) driving the sensitivities to zero. I ...
Dynamic optimization provides a unified framework for improving process operations while taking operational constraints into account. In the presence of uncertainty, measurements can be incorporated into the optimization framework for tracking the optimum. ...
This paper addresses an optimization based approach to follow a geometrically defined path by an unmanned helicopter. In particular, this approach extends reference model following concepts. Instead of using vehicle dynamics, the optimization is based on t ...
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal reward of such a Markov Decision Process, satisfying a Bellman equation, con ...