Searcharxiv⌕ Search

arXiv subjects

Manuel Klädtke

Publications and source records attributed to Manuel Klädtke.

10 recordsLinked to original sources

When Persistency is not Exciting in Data-Driven Predictive Control

Understanding how to collect data that is "meaningful" for control purposes is of paramount importance in data-driven control. While existing approaches have primarily relied on the satisfaction of a rank condition to assess the quality of an experiment, we show that satisfying it is not always sufficient to achieve satisfactory closed-loop performance. Focusing on scenarios where white-noise-like excitation cannot be used for data collection, we examine the frequency-domain implications of linear behavioral representation. This analysis demonstrates that leakage effects are the main driver for data to represent the dynamics of the system. These findings are reflected in our numerical results. Data-enabled predictive controllers built on datasets with insufficient bandwidth, despite fulfilling standard rank conditions, suffer from severe ill-conditioning and fail to achieve reference tracking.

eess.SY↗

On the Effect of Quadratic Regularization in Direct Data-Driven LQR

This paper proposes an explainability concept for direct data-driven linear quadratic regulation (LQR) with quadratic regularization. Our perspective follows the parametric effect of regularization, an analysis approach that translates regularization costs from auxiliary variables to system quantities, enabling intuitive interpretations. The framework further enables the elimination of auxiliary variables, thereby reducing computational complexity. We demonstrate the effectiveness of our approach and the identified effect of regularization via simulations.

eess.SY↗

On data usage and predictive behavior of data-driven predictive control with 1-norm regularization

We investigate the data usage and predictive behavior of data-driven predictive control (DPC) with 1-norm regularization. Our analysis enables the offline removal of unused data and facilitates a comparison between the identified symmetric structure and data usage against prior knowledge of the true system. This comparison helps assess the suitability of the DPC scheme for effective control.

eess.SY↗

Extending direct data-driven predictive control towards systems with finite control sets

Although classical model predictive control with finite control sets (FCS-MPC) is quite a popular control method, particularly in the realm of power electronics systems, its direct data-driven predictive control (FCS-DPC) counterpart has received relatively limited attention. In this paper, we introduce a novel reformulation of a commonly used DPC scheme that allows for the application of a modified sphere decoding algorithm, known for its efficiency and prominence in FCS-MPC applications. We test the reformulation on a popular electrical drive example and compare the computation times of sphere decoding FCS-DPC with an enumeration-based and a MIQP method.

eess.SY↗

Convex NMPC reformulations for a special class of nonlinear multi-input systems with application to rank-one bilinear networks

We show that a special class of (nonconvex) NMPC problems admits an exact solution by reformulating them as a finite number of convex subproblems, extending previous results to the multi-input case. Our approach is applicable to a special class of input-affine discrete-time systems, which includes a class of bilinear rank-one systems that is considered useful in modeling certain controlled networks. We illustrate our results with two numerical examples, including the aforementioned rank-one bilinear network.

eess.SY↗

Implicit predictors in regularized data-driven predictive control

We introduce the notion of implicit predictors, which characterize the input-(state)-output prediction behavior underlying a predictive control scheme, even if it is not explicitly enforced as an equality constraint (as in traditional model or subspace predictive control). To demonstrate this concept, we derive and analyze implicit predictors for some basic data-driven predictive control (DPC) schemes, which offers a new perspective on this popular approach that may form the basis for modified DPC schemes and further theoretical insights.

eess.SY↗

Towards explainable data-driven predictive control with regularizations

Data-driven predictive control (DPC), using linear combinations of recorded trajectory data, has recently emerged as a popular alternative to traditional model predictive control (MPC). Without an explicitly enforced prediction model, the effects of commonly used regularization terms (and the resulting predictions) can be opaque. This opacity may lead to practical challenges, such as reliance on empirical tuning of regularization parameters based on closed-loop performance, and potentially misleading heuristic interpretations of norm-based regularizations. However, by examining the structure of the underlying optimal control problem (OCP), more precise and insightful interpretations of regularization effects can be derived. In this paper, we demonstrate how to analyze the predictive behavior of DPC through implicit predictors and the trajectory-specific effects of quadratic regularization. We further extend these results to cover typical DPC modifications, including DPC for affine systems, offset regularizations, slack variables, and terminal constraints. Additionally, we provide a simple but general result on (recursive) feasibility in DPC. This work aims to enhance the explainability and reliability of DPC by providing a deeper understanding of these regularization mechanisms.

eess.SY↗

Towards a unifying framework for data-driven predictive control with quadratic regularization

Data-driven predictive control (DPC) has recently gained popularity as an alternative to model predictive control (MPC). Amidst the surge in proposed DPC frameworks, upon closer inspection, many of these frameworks are more closely related (or perhaps even equivalent) to each other than it may first appear. We argue for a more formal characterization of these relationships so that results can be freely transferred from one framework to another, rather than being uniquely attributed to a particular framework. We demonstrate this idea by examining the connection between $γ$-DDPC and the original DeePC formulation.

eess.SY↗

A deterministic view on explicit data-driven (M)PC

We show that the explicit realization of data-driven predictive control (DPC) for linear deterministic systems is more tractable than previously thought. To this end, we compare the optimal control problems (OCP) corresponding to deterministic DPC and classical model predictive control (MPC), specify its close relation, and systematically eliminate ambiguity inherent in DPC. As a central result, we find that the explicit solutions to these types of DPC and MPC are of exactly the same complexity. We illustrate our results with two numerical examples highlighting features of our approach.

eess.SY↗

Convex reformulations for a special class of nonlinear MPC problems

We show how the solution to NMPC problems for a special type of input-affine discrete-time systems can be obtained by reformulating the underlying non-convex optimal control problem in terms of a finite number of convex subproblems. The reformulation is facilitated by exact (input-state) linearization, which is shown to provide beneficial properties for the treated class of systems. We characterize possible types of the resulting convex subproblems and illustrate our approach with three numerical examples.

eess.SY↗