no code implementations • 3 Apr 2024 • Manuel Klädtke, Moritz Schulze Darup, Daniel E. Quevedo
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.
no code implementations • 3 Apr 2024 • Manuel Klädtke, Moritz Schulze Darup
Data-driven predictive control (DPC) has recently gained popularity as an alternative to model predictive control (MPC).
no code implementations • 20 Jul 2023 • Manuel Klädtke, Moritz Schulze Darup
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).
no code implementations • 17 Apr 2023 • Manuel Klädtke, Moritz Schulze Darup
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.
no code implementations • 17 Jun 2022 • Manuel Klädtke, Moritz Schulze Darup
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.
no code implementations • 14 Jun 2022 • Manuel Klädtke, Dieter Teichrib, Nils Schlüter, Moritz Schulze Darup
We show that the explicit realization of data-driven predictive control (DPC) for linear deterministic systems is more tractable than previously thought.