arXiv subjects

Karl Worthmann

Publications and source records attributed to Karl Worthmann.

At least 73 records · Page 4Linked to original sources

arXiv2024

Distributed Optimization for Energy Grids: A Tutorial on ADMM and ALADIN

The ongoing transition towards energy and power systems dominated by a large number of renewable power injections to the distribution grid poses substantial challenges for system operation, coordination, and control. Optimization-based methods for coordination and control are of substantial research interest in this context. Hence, this chapter provides a tutorial introduction of distributed optimization algorithms for energy systems with a large share of renewables. Specifically, we focus on the Alternating Direction Method of Multipliers (ADMM) and on the Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) method as both algorithms are frequently considered for coordination and control of power and energy systems. We discuss the application of ALADIN and ADMM to AC optimal power flow problems and to energy management problems. Moreover, we give an outlook on open problems.

math.OC↗

arXiv2024

Towards Efficient Aggregation of Storage Flexibilities in Power Grids

The increasing penetration of volatile renewables combined with increasing demands poses a challenge to modern power grids. Furthermore, distributed energy resources and flexible devices (electric vehicles, PV generation, ...) are becoming more widespread, making their aggregate usage for ancillary services interesting. However, accurately quantifying the aggregate flexibility of numerous flexible devices is known to be limited by the curse of dimensionality, i.e., it does not scale well computationally. This has led to the development of various approximation algorithms. In this study, we improve upon our previously proposed vertex-based inner approximation, extending it to more general storage devices. We demonstrate the efficacy and accuracy of the proposed method in a case study comparing our approach with an exact centralized control framework, where the flexibility of numerous electric vehicles is combined to reduce the peak load in a residential area.

math.OC↗

arXiv2024

On model predictive control with sampled-data input for output tracking with prescribed performance

We propose a model predictive control (MPC) scheme with sampled-data input which ensures output-reference tracking within prescribed error bounds for relative-degree-one systems. Hereby, we explicitly deduce bounds on the required maximal control input and sampling frequency such that the MPC scheme is both initially and recursively feasible. A key feature of the proposed approach is that neither terminal conditions nor a sufficiently-large prediction horizon are imposed, rendering the MPC scheme computationally efficient. We illustrate the MPC algorithm via a numerical example of a torsional oscillator.

math.OC↗

arXiv2024

Alleviating the Curse of Dimensionality in Minkowski Sum Approximations of Storage Flexibility

Many real-world applications require the joint optimization of a large number of flexible devices over time. The flexibility of, e.g., multiple batteries, thermostatically controlled loads, or electric vehicles can be used to support grid operation and to reduce operation costs. Using piecewise constant power values, the flexibility of each device over $d$ time periods can be described as a polytopic subset in power space. The aggregated flexibility is given by the Minkowski sum of these polytopes. As the computation of Minkowski sums is in general demanding, several approximations have been proposed in the literature. Yet, their application potential is often objective-dependent and limited by the curse of dimensionality. We show that up to $2^d$ vertices of each polytope can be computed efficiently and that the convex hull of their sums provides a computationally efficient inner approximation of the Minkowski sum. Via an extensive simulation study, we illustrate that our approach outperforms ten state-of-the-art inner approximations in terms of computational complexity and accuracy for different objectives. Moreover, we propose an efficient disaggregation method applicable to any vertex-based approximation. The proposed methods provide an efficient means to aggregate and to disaggregate energy storages in quarter-hourly periods over an entire day with reasonable accuracy for aggregated cost and for peak power optimization.

math.OC↗

arXiv2024

Fast and memory-efficient optimization for large-scale data-driven predictive control

Recently, data-enabled predictive control (DeePC) schemes based on Willems' fundamental lemma have attracted considerable attention. At the core are computations using Hankel-like matrices and their connection to the concept of persistency of excitation. We propose an iterative solver for the underlying data-driven optimal control problems resulting from linear discrete-time systems. To this end, we apply factorizations based on the discrete Fourier transform of the Hankel-like matrices, which enable fast and memory-efficient computations. To take advantage of this factorization in an optimal control solver and to reduce the effect of inherent bad conditioning of the Hankel-like matrices, we propose an augmented Lagrangian lBFGS-method. We illustrate the performance of our method by means of a numerical study.

math.OC↗

arXiv2023

Error bounds for kernel-based approximations of the Koopman operator

We consider the data-driven approximation of the Koopman operator for stochastic differential equations on reproducing kernel Hilbert spaces (RKHS). Our focus is on the estimation error if the data are collected from long-term ergodic simulations. We derive both an exact expression for the variance of the kernel cross-covariance operator, measured in the Hilbert-Schmidt norm, and probabilistic bounds for the finite-data estimation error. Moreover, we derive a bound on the prediction error of observables in the RKHS using a finite Mercer series expansion. Further, assuming Koopman-invariance of the RKHS, we provide bounds on the full approximation error. Numerical experiments using the Ornstein-Uhlenbeck process illustrate our results.

math.DS↗

arXiv2023

Error analysis of kernel EDMD for prediction and control in the Koopman framework

Extended Dynamic Mode Decomposition (EDMD) is a popular data-driven method to approximate the Koopman operator for deterministic and stochastic (control) systems. This operator is linear and encompasses full information on the (expected stochastic) dynamics. In this paper, we analyze a kernel-based EDMD algorithm, known as kEDMD, where the dictionary consists of the canonical kernel features at the data points. The latter are acquired by i.i.d. samples from a user-defined and application-driven distribution on a compact set. We prove bounds on the prediction error of the kEDMD estimator when sampling from this (not necessarily ergodic) distribution. The error analysis is further extended to control-affine systems, where the considered invariance of the Reproducing Kernel Hilbert Space is significantly less restrictive in comparison to invariance assumptions on an a-priori chosen dictionary.

math.DS↗

arXiv2023

Safe data-driven reference tracking with prescribed performance

We study output reference tracking for unknown continuous-time systems with arbitrary relative degree. The control objective is to keep the tracking error within predefined time-varying bounds while measurement data is only available at discrete sampling times. To achieve the control objective, we propose a two-component controller. One part is a recently developed sampled-data zero-order hold controller, which achieves reference tracking within prescribed error bounds. To further improve the control signal, we explore the system dynamics via input-output data, and include as the second component a data-driven MPC scheme based on Willems et al.'s fundamental lemma. This combination yields significantly improved input signals as illustrated by a numerical example.

math.OC↗

arXiv2023

Robust Funnel Model Predictive Control for output tracking with prescribed performance

We propose a novel robust Model Predictive Control (MPC) scheme for nonlinear multi-input multi-output systems of relative degree one with stable internal dynamics. The proposed algorithm is a combination of funnel MPC, i.e., MPC with a particular stage cost, and the model-free adaptive funnel controller. The new robust funnel MPC scheme guarantees output tracking of reference signals within prescribed performance bounds -- even in the presence of unknown disturbances and a structural model-plant mismatch. We show initial and recursive feasibility of the proposed control scheme without imposing terminal conditions or any requirements on the prediction horizon. Moreover, we allow for model updates at runtime. To this end, we propose a proper initialization strategy, which ensures that recursive feasibility is preserved. Finally, we validate the performance of the proposed robust MPC scheme by simulations.

math.OC↗

arXiv2023

Energy-optimal control of adaptive structures

Adaptive structures are equipped with sensors and actuators to actively counteract external loads such as wind. This can significantly reduce resource consumption and emissions during the life cycle compared to conventional structures. A common approach for active damping is to derive a port-Hamiltonian model and to employ linear-quadratic control. However, the quadratic control penalization lacks physical interpretation and merely serves as a regularization term. Rather, we propose a controller, which achieves the goal of vibration damping while acting energy-optimal. Leveraging the port-Hamiltonian structure, we show that the optimal control is uniquely determined, even on singular arcs. Further, we prove a stable long-time behavior of optimal trajectories by means of a turnpike property. Last, the proposed controller's efficiency is evaluated in a numerical study.

eess.SY↗

arXiv2023

Hidden regularity in singular optimal control of port-Hamiltonian systems

We study the problem of state transition on a finite time interval with minimal energy supply for linear port-Hamiltonian systems. While the cost functional of minimal energy supply is intrinsic to the port-Hamiltonian structure, the necessary conditions of optimality resulting from Pontryagin's maximum principle may yield singular arcs. The underlying reason is the linear dependence on the control, which makes the problem of determining the optimal control as a function of the state and the adjoint more complicated or even impossible. To resolve this issue, we fully characterize regularity of the (differential-algebraic) optimality system by using the interplay of the cost functional and the dynamics. In case of the optimality DAE being characterized by a regular matrix pencil, we fully determine the control on the singular arc. In case of singular matrix pencils of the optimality system, we propose an approach to compute rank-minimal quadratic perturbations of the objective such that the optimal control problem becomes regular. We illustrate the applicability of our results by a general second-order mechanical system and a discretized boundary-controlled heat equation.

math.OC↗

arXiv2023

Reprojection methods for Koopman-based modelling and prediction

Extended Dynamic Mode Decomposition (eDMD) is a powerful tool to generate data-driven surrogate models for the prediction and control of nonlinear dynamical systems in the Koopman framework. In eDMD a compression of the lifted system dynamics on the space spanned by finitely many observables is computed, in which the original space is embedded as a low-dimensional manifold. While this manifold is invariant for the infinite-dimensional Koopman operator, this invariance is typically not preserved for its eDMD-based approximation. Hence, an additional (re-)projection step is often tacitly incorporated to improve the prediction capability. We propose a novel framework for consistent reprojectors respecting the underlying manifold structure. Further, we present a new geometric reprojector based on maximum-likelihood arguments, which significantly enhances the approximation accuracy and preserves known finite-data error bounds.

math.DS↗

arXiv2023

Behavioral Theory for Stochastic Systems? A Data-driven Journey from Willems to Wiener and Back Again

The fundamental lemma by Jan C. Willems and co-workers, which is deeply rooted in behavioral systems theory, has become one of the supporting pillars of the recent progress on data-driven control and system analysis. This tutorial-style paper combines recent insights into stochastic and descriptor-system formulations of the lemma to further extend and broaden the formal basis for behavioral theory of stochastic linear systems. We show that series expansions -- in particular Polynomial Chaos Expansions (PCE) of $L^2$-random variables, which date back to Norbert Wiener's seminal work -- enable equivalent behavioral characterizations of linear stochastic systems. Specifically, we prove that under mild assumptions the behavior of the dynamics of the $L^2$-random variables is equivalent to the behavior of the dynamics of the series expansion coefficients and that it entails the behavior composed of sampled realization trajectories. We also illustrate the short-comings of the behavior associated to the time-evolution of the statistical moments. The paper culminates in the formulation of the stochastic fundamental lemma for linear (descriptor) systems, which in turn enables numerically tractable formulations of data-driven stochastic optimal control combining Hankel matrices in realization data (i.e. in measurements) with PCE concepts.

math.OC↗

arXiv2023

On Koopman-based surrogate models for non-holonomic robots

Data-driven surrogate models of dynamical systems based on the extended dynamic mode decomposition are nowadays well-established and widespread in applications. Further, for non-holonomic systems exhibiting a multiplicative coupling between states and controls, the usage of bi-linear surrogate models has proven beneficial. However, an in-depth analysis of the approximation quality and its dependence on different hyperparameters based on both simulation and experimental data is still missing. We investigate a differential-drive mobile robot to close this gap and provide first guidelines on the systematic design of data-efficient surrogate models.

cs.RO↗

arXiv2022

Path Planning for Concentric Tube Robots: a Toolchain with Application to Stereotactic Neurosurgery

We present a toolchain for solving path planning problems for concentric tube robots through obstacle fields. First, ellipsoidal sets representing the target area and obstacles are constructed from labelled point clouds. Then, the nonlinear and highly nonconvex optimal control problem is solved by introducing a homotopy on the obstacle positions where at one extreme of the parameter the obstacles are removed from the operating space, and at the other extreme they are located at their intended positions. We present a detailed example (with more than a thousand obstacles) from stereotactic neurosurgery with real-world data obtained from labelled MPRI scans.

math.OC↗

arXiv2022

Towards reliable data-based optimal and predictive control using extended DMD

While Koopman-based techniques like extended Dynamic Mode Decomposition are nowadays ubiquitous in the data-driven approximation of dynamical systems, quantitative error estimates were only recently established. To this end, both sources of error resulting from a finite dictionary and only finitely-many data points in the generation of the surrogate model have to be taken into account. We generalize the rigorous analysis of the approximation error to the control setting while simultaneously reducing the impact of the curse of dimensionality by using a recently proposed bilinear approach. In particular, we establish uniform bounds on the approximation error of state-dependent quantities like constraints or a performance index enabling data-based optimal and predictive control with guarantees.

math.OC↗

arXiv2022

Model Predictive Control Tailored to Epidemic Models

We propose a model predictive control (MPC) approach for minimising the social distancing and quarantine measures during a pandemic while maintaining a hard infection cap. To this end, we study the admissible and the maximal robust positively invariant set (MRPI) of the standard SEIR compartmental model with control inputs. Exploiting the fact that in the MRPI all restrictions can be lifted without violating the infection cap, we choose a suitable subset of the MRPI to define terminal constraints in our MPC routine and show that the number of infected people decays exponentially within this set. Furthermore, under mild assumptions we prove existence of a uniform bound on the time required to reach this terminal region (without violating the infection cap) starting in the admissible set. The findings are substantiated based on a numerical case study.

math.OC↗

arXiv2022

Model predictive control for retinal laser treatment at 1 kHz

Laser photocoagulation is a technique applied in the treatment of retinal diseases. While this is often done manually or using simple control schemes, we pursue an optimization-based approach, namely Model Predictive Control (MPC), to enforce bounds on the peak temperature and, thus, safety during the medical treatment procedure - despite the spot-dependent absorption of the tissue. To this end, a repetition rate of 1 kHz is desirable rendering the real-time requirements a major challenge. We present a tailored MPC scheme using parametric model reduction, an extended Kalman filter for the parameter and state estimation, and suitably constructed stage costs and verify its applicability both in simulation and experiments with porcine eyes. Moreover, we give some insight on the implementation specifically tailored for fast numerical computations.

eess.SY↗