SearcharxivSearch

arXiv · 2011.12798

Adaptive Learning of Hybrid Models for Nonlinear Model Predictive Control of Distillation Columns

Abstract

Nonlinear model predictive control (NMPC) requires accurate and computationally efficient plant models. Our previous work has shown that the classical compartmentalization model reduction approach for distillation columns can be enhanced by replacing parts of the system of equations by artificial neural networks (ANNs) trained on offline solved solutions to improve computational performance. In real-life applications, the absence of a high-fidelity model for data generation can, however, prevent the deployment of this approach. Therefore, we propose a method that utilizes solely plant measurement data, starting from a small initial data set and then continuously adapting to newly measured data. The efficacy of the proposed approach is examined in silico for a distillation column from literature. To this end, we first adjust our reduced hybrid mechanistic/data-driven modeling approach that originally builds on compartmentalization to a stage-aggregation procedure, tailoring it for the application within the adaptive learning framework. Second, we apply an adaptive learning algorithm that trains the ANNs replacing the stationary stage-to-stage calculations on newly available data. We apply the adaptive learning of the hybrid model within a regulatory NMPC framework and conduct closed-loop simulations. We demonstrate that by using the proposed method, the control performance can be steadily improved over time compared to a non-adaptive approach while being real-time applicable. Moreover, we show that the performance when using either a model trained on excessive amounts of offline generated data or the original high-fidelity model can be approached in the limit.

Explore related subjects

Keep this discovery

BibTeXRIS

Jannik T. Lüthje, Jan C. Schulze, Adrian Caspari, Adel Mhamdi, Alexander Mitsos, Pascal Schäfer. 2020-11-25. Adaptive Learning of Hybrid Models for Nonlinear Model Predictive Control of Distillation Columns. https://arxiv.org/abs/2011.12798

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC