Search arXivSearch

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

Explore connections, maps & timelines

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

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC