Nonparametric nonlinear model predictive control

Model Predictive Control (MPC) has recently found wide acceptance in industrial applications, but its potential has been much impeded by linear models due to the lack of a similarly accepted nonlinear modeling or databased technique. Aimed at solving this problem, the paper addresses three issues: (i) extending second-order Volterra nonlinear MPC (NMPC) to higher-order for improved prediction and control; (ii) formulating NMPC directly with plant data without needing for parametric modeling, which has hindered the progress of NMPC; and (iii) incorporating an error estimator directly in the formulation and hence eliminating the need for a nonlinear state observer. Following analysis of NMPC objectives and existing solutions, nonparametric NMPC is derived in discrete-time using multidimensional convolution between plant data and Volterra kernel measurements. This approach is validated against the benchmark van de Vusse nonlinear process control problem and is applied to an industrial polymerization process by using Volterra kernels of up to the third order. Results show that the nonparametric approach is very efficient and effective and considerably outperforms existing methods, while retaining the original data-based spirit and characteristics of linear MPC

High-order volterra model predictive control and its application to a nonlinear polymerisation process

Model Predictive Control (MPC) has recently found wide acceptance in the process industry, but the existing design and implementation methods are restricted to linear process models. A chemical process involves, however, severe nonlinearity which cannot be ignored in practice. This paper aims to solve this nonlinear control problem by extending MPC to nonlinear models. It develops an analytical framework for nonlinear model predictive control (NMPC), and also offers a third-order Volterra series based nonparametric nonlinear modelling technique for NMPC design which relieves practising engineers from the need for first deriving a physical-principles based model. An on-line realisation technique for implementing the NMPC is also developed. The NMPC is then applied to a Mitsubishi Chemicals polymerisation reaction process. The results show that this nonlinear MPC technique is feasible and very effective. It considerably outperforms linear and low-order Volterra model based methods. The advantages of the approach developed lie not only in control performance superior to existing NMPC methods, but also in relieving practising engineers from the need for deriving an analytical model and then converting it to a Volterra model through which the model can only be obtained up to the second order

Tensor Network alternating linear scheme for MIMO Volterra system identification

This article introduces two Tensor Network-based iterative algorithms for the identification of high-order discrete-time nonlinear multiple-input multiple-output (MIMO) Volterra systems. The system identification problem is rewritten in terms of a Volterra tensor, which is never explicitly constructed, thus avoiding the curse of dimensionality. It is shown how each iteration of the two identification algorithms involves solving a linear system of low computational complexity. The proposed algorithms are guaranteed to monotonically converge and numerical stability is ensured through the use of orthogonal matrix factorizations. The performance and accuracy of the two identification algorithms are illustrated by numerical experiments, where accurate degree-10 MIMO Volterra models are identified in about 1 second in Matlab on a standard desktop pc

Tensor Computation: A New Framework for High-Dimensional Problems in EDA

Many critical EDA problems suffer from the curse of dimensionality, i.e. the very fast-scaling computational burden produced by large number of parameters and/or unknown variables. This phenomenon may be caused by multiple spatial or temporal factors (e.g. 3-D field solvers discretizations and multi-rate circuit simulation), nonlinearity of devices and circuits, large number of design or optimization parameters (e.g. full-chip routing/placement and circuit sizing), or extensive process variations (e.g. variability/reliability analysis and design for manufacturability). The computational challenges generated by such high dimensional problems are generally hard to handle efficiently with traditional EDA core algorithms that are based on matrix and vector computation. This paper presents "tensor computation" as an alternative general framework for the development of efficient EDA algorithms and tools. A tensor is a high-dimensional generalization of a matrix and a vector, and is a natural choice for both storing and solving efficiently high-dimensional EDA problems. This paper gives a basic tutorial on tensors, demonstrates some recent examples of EDA applications (e.g., nonlinear circuit modeling and high-dimensional uncertainty quantification), and suggests further open EDA problems where the use of tensor computation could be of advantage.Comment: 14 figures. Accepted by IEEE Trans. CAD of Integrated Circuits and System

AReS and MaRS - Adversarial and MMD-Minimizing Regression for SDEs

Stochastic differential equations are an important modeling class in many disciplines. Consequently, there exist many methods relying on various discretization and numerical integration schemes. In this paper, we propose a novel, probabilistic model for estimating the drift and diffusion given noisy observations of the underlying stochastic system. Using state-of-the-art adversarial and moment matching inference techniques, we avoid the discretization schemes of classical approaches. This leads to significant improvements in parameter accuracy and robustness given random initial guesses. On four established benchmark systems, we compare the performance of our algorithms to state-of-the-art solutions based on extended Kalman filtering and Gaussian processes.Comment: Published at the Thirty-sixth International Conference on Machine Learning (ICML 2019