NMPC in active subspaces: dimensionality reduction with recursive feasibility guarantees

From MaRDI portal
Publication:2103689

DOI10.1016/J.AUTOMATICA.2022.110708zbMATH Open1505.93057arXiv2209.10915OpenAlexW4308984485MaRDI QIDQ2103689FDOQ2103689

Timm Faulwasser, Guanru Pan

Publication date: 9 December 2022

Published in: Automatica (Search for Journal in Brave)

Abstract: Dimensionality reduction of decision variables is a practical and classic method to reduce the computational burden in linear and Nonlinear Model Predictive Control (NMPC). Available results range from early move-blocking ideas to singular-value decomposition. For schemes more complex than move-blocking it is seemingly not straightforward to guarantee recursive feasibility of the receding-horizon optimization. Decomposing the space of decision variables related to the inputs into active and inactive complements, this paper proposes a general framework for effective feasibility-preserving dimensionality reduction in NMPC. We show how -- independently of the actual choice of the subspaces -- recursive feasibility can be established. Moreover, we propose the use of global sensitivity analysis to construct the active subspace in data-driven fashion based on user-defined criteria. Numerical examples illustrate the efficacy of the proposed scheme. Specifically, for a chemical reactor we obtain a significant reduction by factor 2040 at a closed-loop performance decay of less than 0.05%.


Full work available at URL: https://arxiv.org/abs/2209.10915




Recommendations




Cites Work


Cited In (1)

Uses Software





This page was built for publication: NMPC in active subspaces: dimensionality reduction with recursive feasibility guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103689)