Tobias Damm
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tobias Damm has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Peter Benner
Max Planck Institute for Dynamics of Complex Technical Systems, D-39106 Magdeburg, Germany
4 shared publications Axel Vierling
Department of Computer Science University of Kaiserslautern Kaiserslautern Germany
2 shared publications- Christian Grussler
The Stephen B. Klein Faculty of Aerospace Engineering, Technion - Israel Institute of Technology, Haifa, 3200003
2 shared publications - Hiroyuki Sato
Department of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan
2 shared publications - Jan Hauth
Fraunhofer ITWM, Kaiserslautern, Germany
2 shared publications - Jens Göbel
Department of System Analysis, Prognosis and Control, Fraunhofer Institute for Industrial Mathematics (ITWM), Kaiserslautern, Germany
2 shared publications
Latest Publications
- Open Access
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1622-1627
On Model Predictive Funnel Control With Equilibrium Endpoint Constraints
We propose model predictive funnel control, a novel model predictive control (MPC) scheme building upon recent results in funnel control. The latter is a high-gain feedback methodology that achieves evolution of the measured output within predefined error margins. The proposed method dynamically optimizes a parameter-dependent error boundary in a receding-horizon manner, thereby combining prescribed error guarantees from funnel control with the predictive advantages of MPC. On the one hand, this approach promises faster optimization times due to a reduced number of decision variables, whose number does not depend on the horizon length. On the other hand, the continuous feedback law improves the robustness and also explicitly takes care of the inter-sampling behavior. We focus on proving stability by leveraging results from MPC stability theory with terminal equality constraints. Moreover, we rigorously show initial and recursive feasibility.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1622-1627
Open AccessOn Model Predictive Funnel Control With Equilibrium Endpoint Constraints
We propose model predictive funnel control, a novel model predictive control (MPC) scheme building upon recent results in funnel control. The latter is a high-gain feedback methodology that achieves evolution of the measured output within predefined error margins. The proposed method dynamically optimizes a parameter-dependent error boundary in a receding-horizon manner, thereby combining prescribed error guarantees from funnel control with the predictive advantages of MPC. On the one hand, this approach promises faster optimization times due to a reduced number of decision variables, whose number does not depend on the horizon length. On the other hand, the continuous feedback law improves the robustness and also explicitly takes care of the inter-sampling behavior. We focus on proving stability by leveraging results from MPC stability theory with terminal equality constraints. Moreover, we rigorously show initial and recursive feasibility.
- Open Access
On the balanced truncation error bound and sign parameters from arrowhead realizations
Balanced truncation and singular perturbation approximation for linear dynamical systems yield reduced-order models that satisfy a well-known error bound involving the Hankel singular values. We show that this bound holds with equality for single-input, single-output systems, if the sign parameters corresponding to the truncated Hankel singular values are all equal. These signs are determined by a generalized state-space symmetry property of the corresponding linear model. For a special class of systems having arrowhead realizations, the signs can be determined directly from the off-diagonal entries of the corresponding arrowhead matrix. We describe how such arrowhead systems arise naturally in certain applications of network modeling, and illustrate these results with a power system model that motivated this study.
Open AccessOn the balanced truncation error bound and sign parameters from arrowhead realizations
Balanced truncation and singular perturbation approximation for linear dynamical systems yield reduced-order models that satisfy a well-known error bound involving the Hankel singular values. We show that this bound holds with equality for single-input, single-output systems, if the sign parameters corresponding to the truncated Hankel singular values are all equal. These signs are determined by a generalized state-space symmetry property of the corresponding linear model. For a special class of systems having arrowhead realizations, the signs can be determined directly from the off-diagonal entries of the corresponding arrowhead matrix. We describe how such arrowhead systems arise naturally in certain applications of network modeling, and illustrate these results with a power system model that motivated this study.
- Open Access
- 10 December 2023
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 45 (3) , 993-1006
Distributed model predictive control based on the alternating directions method of multipliers applied to voltage and frequency control in power systems
- 10 December 2023
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 45 (3) , 993-1006
Open AccessDistributed model predictive control based on the alternating directions method of multipliers applied to voltage and frequency control in power systems
- Open Access
- 10 November 2023
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 360 (18) , 14534-14552
Complexity reduction of large-scale stochastic systems using linear quadratic Gaussian balancing
- 10 November 2023
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 360 (18) , 14534-14552
Open AccessComplexity reduction of large-scale stochastic systems using linear quadratic Gaussian balancing
- Open Access
Complexity reduction of large-scale stochastic systems using linear quadratic Gaussian balancing
In this paper, we consider a model reduction technique for stabilizable and detectable stochastic systems. It is based on a pair of Gramians that we analyze in terms of well-posedness. Subsequently, dominant subspaces of the stochastic systems are identified exploiting these Gramians. An associated balancing related scheme is proposed that removes unimportant information from the stochastic dynamics in order to obtain a reduced system. We show that this reduced model preserves important features like stabilizability and detectability. Additionally, a comprehensive error analysis based on eigenvalues of the Gramian pair product is conducted. This provides an a-priori criterion for the reduction quality which we illustrate in numerical experiments.
Open AccessComplexity reduction of large-scale stochastic systems using linear quadratic Gaussian balancing
In this paper, we consider a model reduction technique for stabilizable and detectable stochastic systems. It is based on a pair of Gramians that we analyze in terms of well-posedness. Subsequently, dominant subspaces of the stochastic systems are identified exploiting these Gramians. An associated balancing related scheme is proposed that removes unimportant information from the stochastic dynamics in order to obtain a reduced system. We show that this reduced model preserves important features like stabilizability and detectability. Additionally, a comprehensive error analysis based on eigenvalues of the Gramian pair product is conducted. This provides an a-priori criterion for the reduction quality which we illustrate in numerical experiments.
- Open Access
Hadamard Powers and Kernel Perceptrons
We study a relation between Hadamard powers and polynomial kernel perceptrons. The rank of Hadamard powers for the special case of a Boolean matrix and for the generic case of a real matrix is computed explicitly. These results are interpreted in terms of the classification capacities of perceptrons.
Open AccessHadamard Powers and Kernel Perceptrons
We study a relation between Hadamard powers and polynomial kernel perceptrons. The rank of Hadamard powers for the special case of a Boolean matrix and for the generic case of a real matrix is computed explicitly. These results are interpreted in terms of the classification capacities of perceptrons.
- 26 April 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 672, 93-107
Hadamard powers and kernel perceptrons
- 26 April 2023
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 672, 93-107
Hadamard powers and kernel perceptrons
- Open Access
On Coercivity and the Frequency Domain Condition in Indefinite LQ-Control
We introduce a coercivity condition as a time domain analogue of the frequency criterion provided by the famous Kalman-Yakubovich-Popov lemma. For a simple stochastic linear quadratic control problem we show how the coercivity condition characterizes the solvability of Riccati equations.
Open AccessOn Coercivity and the Frequency Domain Condition in Indefinite LQ-Control
We introduce a coercivity condition as a time domain analogue of the frequency criterion provided by the famous Kalman-Yakubovich-Popov lemma. For a simple stochastic linear quadratic control problem we show how the coercivity condition characterizes the solvability of Riccati equations.
- 23 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (1) , 526-531
Balanced Truncation of $k$-Positive Systems
This article considers balanced truncation of discrete-time Hankel $k$ -positive systems, characterized by Hankel matrices whose minors up to order $k$ are nonnegative. Our main result shows that if the truncated system has order $k$ or less, then it is Hankel totally positive ( $\infty$ -positive), meaning that it is a sum of first-order lags. This result can be understood as a bridge between two known results: the property that the first-order truncation of a positive system is positive ( $k=1$ ), and the property that balanced truncation preserves state-space symmetry. It provides a broad class of systems where balanced truncation is guaranteed to result in a minimal internally positive system.
- 23 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (1) , 526-531
Balanced Truncation of $k$-Positive Systems
This article considers balanced truncation of discrete-time Hankel $k$ -positive systems, characterized by Hankel matrices whose minors up to order $k$ are nonnegative. Our main result shows that if the truncated system has order $k$ or less, then it is Hankel totally positive ( $\infty$ -positive), meaning that it is a sum of first-order lags. This result can be understood as a bridge between two known results: the property that the first-order truncation of a positive system is positive ( $k=1$ ), and the property that balanced truncation preserves state-space symmetry. It provides a broad class of systems where balanced truncation is guaranteed to result in a minimal internally positive system.
- Open Access
Balanced truncation of $k$-positive systems
This paper considers balanced truncation of discrete-time Hankel $k$-positive systems, characterized by Hankel matrices whose minors up to order $k$ are nonnegative. Our main result shows that if the truncated system has order $k$ or less, then it is Hankel totally positive ($\infty$-positive), meaning that it is a sum of first order lags. This result can be understood as a bridge between two known results: the property that the first-order truncation of a positive system is positive ($k=1$), and the property that balanced truncation preserves state-space symmetry. It provides a broad class of systems where balanced truncation is guaranteed to result in a minimal internally positive system.Open AccessBalanced truncation of $k$-positive systems
This paper considers balanced truncation of discrete-time Hankel $k$-positive systems, characterized by Hankel matrices whose minors up to order $k$ are nonnegative. Our main result shows that if the truncated system has order $k$ or less, then it is Hankel totally positive ($\infty$-positive), meaning that it is a sum of first order lags. This result can be understood as a bridge between two known results: the property that the first-order truncation of a positive system is positive ($k=1$), and the property that balanced truncation preserves state-space symmetry. It provides a broad class of systems where balanced truncation is guaranteed to result in a minimal internally positive system.