Time Adaptivity in Model Predictive Control

The core of the Model Predictive Control (MPC) method in every step of the algorithm consists in solving a time-dependent optimization problem on the prediction horizon of the MPC algorithm, and then to apply a portion of the optimal control over the application horizon to obtain the new state. To solve this problem efficiently, we propose a time-adaptive residual based a-posteriori error control concept based on the optimality system of this optimal control problem. This approach not only delivers an adaptive time discretization of the prediction horizon, but also suggests an adaptive time discretization of the application horizon, whose length could be either adaptive or fixed. We apply this concept for systems governed by linear parabolic PDEs and present several numerical examples which demonstrate the performance and the robustness of our adaptive MPC control concept.

An adaptive time-stepping method based on a posteriori weak error analysis for large SDE systems

We develop an adaptive algorithm for large SDE systems, which automatically selects (quasi-)deterministic time steps for the semi-implicit Euler method, based on an a posteriori weak error estimate. Main tools to construct the a posteriori estimator are the representation of the weak approximation error via Kolmogorov’s backward equation, a priori bounds for its solution and the Clark–Ocone formula. For a certain class of SDE systems, we validate optimal weak convergence order 1 of the a posteriori estimator, and termination of the adaptive method based on it within $${{\mathcal {O}}}(\mathtt{Tol}^{-1})$$ O ( Tol - 1 ) steps.