Publications

In this paper, we provide insights on how much testing and social distancing is required to control COVID-19. To this end, we develop a compartmental model that accounts for key aspects of the disease: incubation time, age-dependent symptom severity, and testing and hospitalization delays; the model's parameters are chosen based on medical evidence, and, for concreteness, adapted to the German situation. Then, optimal mass-testing and age-dependent social distancing policies are determined by solving optimal control problems both in open loop and within a model predictive control framework. We aim to minimize testing and/or social distancing until herd immunity sets in under a constraint on the number of available intensive care units. We find that an early and short lockdown is inevitable but can be slowly relaxed over the following months.

In this letter we investigate data-driven predictive control of discrete-time linear descriptor systems. Specifically, we give a tailored variant of Willems' fundamental lemma, which shows that for descriptor systems the non-parametric modeling via a Hankel matrix requires less data compared to linear time-invariant systems without algebraic constraints. Moreover, we use this description to propose a data-driven framework for optimal control and predictive control of discrete-time linear descriptor systems. For the latter, we provide a sufficient stability condition for receding-horizon control before we illustrate our findings with an example.

The relationship between linear relations and matrix pencils is investigated. Given a linear relation, we introduce its Weyr characteristic. If the linear relation is the range (or the kernel) representation of a given matrix pencil, we show that there is a correspondence between this characteristic and the Kronecker canonical form of the pencil. This relationship is exploited to obtain estimations on the invariant characteristics of matrix pencils under rank one perturbations.

We study model predictive control for singular differential-algebraic equations with higher index. This is a novelty when compared to the literature where only regular differential-algebraic equations with additional assumptions on the index and/or controllability are considered. By regularisation techniques, we are able to derive an equivalent optimal control problem for an ordinary differential equation to which well-known model predictive control techniques can be applied. This allows the construction of terminal constraints and costs such that the origin is asymptotically stable w.r.t. the resulting closed-loop system.

In a single-objective setting, nonconvex quadratic problems can equivalently be reformulated as convex problems over the cone of completely positive matrices. In small dimensions this cone equals the cone of matrices which are entrywise nonnegative and positive semidefinite, so the convex reformulation can be solved via SDP solvers. Considering multiobjective nonconvex quadratic problems, naturally the question arises, whether the advantage of convex reformulations extends to the multicriteria framework. In this note, we show that this approach only finds the supported nondominated points, which can already be found by using the weighted sum scalarization of the multiobjective quadratic problem, i.e. it is not suitable for multiobjective nonconvex problems.