Herbert Werner
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
Research Subjects
Herbert Werner has a total of 87 co-authors. Here are the top co-authors by number of shared publications:
- Adwait Datar
Institute for Data Science Foundations Hamburg University of Technology 21073 Hamburg Germany
5 shared publications - Annika Eichler
Deutsches Elektronen-Synchrotron DESY
5 shared publications - Gerwald Lichtenberg
Faculty Life Sciences, Hamburg University of Applied Sciences, Hamburg, Germany
4 shared publications - Saulat S. Chughtai
Hamburg University of Technology
4 shared publications - Yang Tang
East China University of Science and Technology
4 shared publications - Adel Farag3 shared publications
Latest Publications
- Open Access
- 1 May 2026
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 3224 (3) , 032085
A Simulative Analysis of Physically-Motivated Koopman Lifted States for Wind Farm Model Predictive Control
This paper investigates how the selection of data points from a simulated wind field, combined with nonlinear lifting functions, influences wind turbine power predictions. The objective is to develop accurate linear models within the Koopman operator framework suitable for real-time Model Predictive Control. Using Dynamic Mode Decomposition, we compare three data configurations from a high-fidelity simulation: a dense wind field with 50,000 points, a dataset restricted to turbine locations, and a sparse dataset including two additional streamwise positions. Results demonstrate that models using data from well-placed sensors can outperform those using dense wind field data. Furthermore, while turbine-only data initially yields lower accuracy, we show that physically motivated Koopman lifting functions effectively compensate for missing spatial information. By incorporating these additional prediction features, turbine-only models achieve prediction accuracies comparable to those utilizing the complete wind field data, which relies on information density unavailable for real-world turbine control.
- 1 May 2026
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 3224 (3) , 032085
Open AccessA Simulative Analysis of Physically-Motivated Koopman Lifted States for Wind Farm Model Predictive Control
This paper investigates how the selection of data points from a simulated wind field, combined with nonlinear lifting functions, influences wind turbine power predictions. The objective is to develop accurate linear models within the Koopman operator framework suitable for real-time Model Predictive Control. Using Dynamic Mode Decomposition, we compare three data configurations from a high-fidelity simulation: a dense wind field with 50,000 points, a dataset restricted to turbine locations, and a sparse dataset including two additional streamwise positions. Results demonstrate that models using data from well-placed sensors can outperform those using dense wind field data. Furthermore, while turbine-only data initially yields lower accuracy, we show that physically motivated Koopman lifting functions effectively compensate for missing spatial information. By incorporating these additional prediction features, turbine-only models achieve prediction accuracies comparable to those utilizing the complete wind field data, which relies on information density unavailable for real-world turbine control.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2497-2502
Lyapunov-Level ${\mathcal{L}}_{{2}}$ -Attenuation Certificates Under Input Constraints- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2497-2502
Lyapunov-Level ${\mathcal{L}}_{{2}}$ -Attenuation Certificates Under Input Constraints- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2347-2352
Internal Dissipation Allocation in Control Lyapunov Function Design
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2347-2352
Internal Dissipation Allocation in Control Lyapunov Function Design
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2149-2154
Concave Shaping of Prescribed Lyapunov Decay Under Input Constraints
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 2149-2154
Concave Shaping of Prescribed Lyapunov Decay Under Input Constraints
- Open Access
Concave Comparison Functions for Accelerating Constrained Lyapunov Decay
What limits how fast a Lyapunov function can decay under input bounds? We address this question by showing how the shape of Lyapunov comparison functions governs guaranteed decay for control affine systems. Using a windowed nominal exponential rate together with the endpoint cap induced by actuator limits, we establish a strict ordering: concave comparison functions strictly outperform linear and convex ones, and strict concavity is necessary to improve the best achievable global exponential rate under a fixed endpoint cap. We derive a computable lower bound on the required actuation level for a target nominal rate and show that only concave shaping can reduce this level under the endpoint cap. We then establish a feasibility-preserving acceleration result: whenever a margin exists on a sublevel set, a feasible linear comparison can be replaced by a concave one that preserves feasibility while strictly increasing the guaranteed windowed decay. Finally, we give a tunable rational concave factor with controlled slope that yields a constructive design and integrates with CLF QP, as illustrated by examples.
Open AccessConcave Comparison Functions for Accelerating Constrained Lyapunov Decay
What limits how fast a Lyapunov function can decay under input bounds? We address this question by showing how the shape of Lyapunov comparison functions governs guaranteed decay for control affine systems. Using a windowed nominal exponential rate together with the endpoint cap induced by actuator limits, we establish a strict ordering: concave comparison functions strictly outperform linear and convex ones, and strict concavity is necessary to improve the best achievable global exponential rate under a fixed endpoint cap. We derive a computable lower bound on the required actuation level for a target nominal rate and show that only concave shaping can reduce this level under the endpoint cap. We then establish a feasibility-preserving acceleration result: whenever a margin exists on a sublevel set, a feasible linear comparison can be replaced by a concave one that preserves feasibility while strictly increasing the guaranteed windowed decay. Finally, we give a tunable rational concave factor with controlled slope that yields a constructive design and integrates with CLF QP, as illustrated by examples.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 41 (15523098) , 6155-6175
CCRobot-S: A Robotic Cable-Climbing Squad Collaborating for Fast Inspection and Heavy-Duty Maintenance
This study introduces a novel climbing strategy, reconfigurable parallel-type cable-driven climbing designed for long-span, large-scale bridge stay cable robotic applications, which has the potential to revolutionize the stay cable inspection and maintenance practice. The proposed methodology features the development of a Collaborative Climbing Robot Squad (CCRobot-S), which builds upon the design principles of the previous CCRobot series. In this study, CCRobot-S implements a parallel-type cable-driven manipulation design, allowing for reconfigurable kinematic morphology by its movable anchor bases and realizing the capacity of crossing over the stay cables for its flying platform. The collaborative robot squad design liberates the dimensions and scales of the robot's reachable workspace and moves the part of the robotic system that indeed needs to be moved, enhancing the working efficiency and climbing agility. This strategy also utilizes controllable adhesion instead of friction to interact with the bridge cable surface for the flying platform, realizing force multiplication for forceful manipulation. Toward bringing high efficiency and heavy-duty capacity, we propose the applicable climbing frameworks (zero-downtime climbing gait for cable inspection and spider-like climbing gait for cable maintenance) and the optimization frameworks (optimal anchor configuration for the movable anchor bases and optimal grasp arrangement for the flying gripper). This article includes the exploration of the design and climbing gaits of CCRobotS, the formulation of the CCRobot-S model, a comprehensive analysis of its workspace, and its climbing strategy and optimization. Extensive experiments have assessed the proposed climbing strategy's effectiveness and showcased CCRobot-S' capabilities.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 41 (15523098) , 6155-6175
CCRobot-S: A Robotic Cable-Climbing Squad Collaborating for Fast Inspection and Heavy-Duty Maintenance
This study introduces a novel climbing strategy, reconfigurable parallel-type cable-driven climbing designed for long-span, large-scale bridge stay cable robotic applications, which has the potential to revolutionize the stay cable inspection and maintenance practice. The proposed methodology features the development of a Collaborative Climbing Robot Squad (CCRobot-S), which builds upon the design principles of the previous CCRobot series. In this study, CCRobot-S implements a parallel-type cable-driven manipulation design, allowing for reconfigurable kinematic morphology by its movable anchor bases and realizing the capacity of crossing over the stay cables for its flying platform. The collaborative robot squad design liberates the dimensions and scales of the robot's reachable workspace and moves the part of the robotic system that indeed needs to be moved, enhancing the working efficiency and climbing agility. This strategy also utilizes controllable adhesion instead of friction to interact with the bridge cable surface for the flying platform, realizing force multiplication for forceful manipulation. Toward bringing high efficiency and heavy-duty capacity, we propose the applicable climbing frameworks (zero-downtime climbing gait for cable inspection and spider-like climbing gait for cable maintenance) and the optimization frameworks (optimal anchor configuration for the movable anchor bases and optimal grasp arrangement for the flying gripper). This article includes the exploration of the design and climbing gaits of CCRobotS, the formulation of the CCRobot-S model, a comprehensive analysis of its workspace, and its climbing strategy and optimization. Extensive experiments have assessed the proposed climbing strategy's effectiveness and showcased CCRobot-S' capabilities.
- 16 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (3) , 2392-2403
Distributed Event-Triggered Attitude Estimation Without Angular Velocity Measurements
In this paper, a distributed event-triggered attitude estimation problem is considered for multiple rigid body systems on $\mathbb {SO}(3)$. The error in attitude estimation converges asymptotically to a common orientation among multiple rigid body systems, based on relative attitude measurements under undirected graphs. To eliminate the reliance on direct angular velocity measurements, a cascaded estimation scheme is proposed, employing indirected angular velocity estimation through a single vector measurement that is readily accessible using accelerometers or magnetometers. An event-triggered condition (ETC), grounded in clock variables, is proposed to reduce the communication and computation requirements associated with the attitude estimation. Subsequently, a rigorous convergence analysis of the attitude estimation errors is conducted, relying upon a stability criteria of invariant sets for cascade-connected systems. Furthermore, a self-triggered condition is developed to overcome the challenge of continuous monitoring throughout the event detection process. Ultimately, the efficacy of the proposed framework is validated through a numerical simulation encompassing multiple small satellites.
- 16 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (3) , 2392-2403
Distributed Event-Triggered Attitude Estimation Without Angular Velocity Measurements
In this paper, a distributed event-triggered attitude estimation problem is considered for multiple rigid body systems on $\mathbb {SO}(3)$. The error in attitude estimation converges asymptotically to a common orientation among multiple rigid body systems, based on relative attitude measurements under undirected graphs. To eliminate the reliance on direct angular velocity measurements, a cascaded estimation scheme is proposed, employing indirected angular velocity estimation through a single vector measurement that is readily accessible using accelerometers or magnetometers. An event-triggered condition (ETC), grounded in clock variables, is proposed to reduce the communication and computation requirements associated with the attitude estimation. Subsequently, a rigorous convergence analysis of the attitude estimation errors is conducted, relying upon a stability criteria of invariant sets for cascade-connected systems. Furthermore, a self-triggered condition is developed to overcome the challenge of continuous monitoring throughout the event detection process. Ultimately, the efficacy of the proposed framework is validated through a numerical simulation encompassing multiple small satellites.
- 8 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (1) , 557-564
Robust Performance Analysis of Cooperative Control Dynamics via Integral Quadratic Constraints
We study cooperative control dynamics with gradient based forcing terms. As a specific example, we focus on source-seeking dynamics with vehicles embedded in an unknown scalar field with a subset of agents having gradient information. We consider time-invariant and uncertain interaction potentials common in formation control and flocking. We leverage the framework of $\alpha$ -integral quadratic constraints to obtain convergence rate estimates whenever exponential stability can be achieved. Sufficient conditions take the form of linear matrix inequalities independent of the size of network. A derivation (purely in time-domain) of the so-called hard Zames-Falb $\alpha$ -IQCs involving general non-causal higher order multipliers is given along with a suitably adapted parameterization of the multipliers to the $\alpha$ -IQC setting. Numerical examples illustrate the application of theoretical results.
- 8 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (1) , 557-564
Robust Performance Analysis of Cooperative Control Dynamics via Integral Quadratic Constraints
We study cooperative control dynamics with gradient based forcing terms. As a specific example, we focus on source-seeking dynamics with vehicles embedded in an unknown scalar field with a subset of agents having gradient information. We consider time-invariant and uncertain interaction potentials common in formation control and flocking. We leverage the framework of $\alpha$ -integral quadratic constraints to obtain convergence rate estimates whenever exponential stability can be achieved. Sufficient conditions take the form of linear matrix inequalities independent of the size of network. A derivation (purely in time-domain) of the so-called hard Zames-Falb $\alpha$ -IQCs involving general non-causal higher order multipliers is given along with a suitably adapted parameterization of the multipliers to the $\alpha$ -IQC setting. Numerical examples illustrate the application of theoretical results.
- Open Access
Transformation-Free Fixed-Structure Model Reduction for LPV Systems
In this paper, we propose a model reduction technique for linear parameter varying (LPV) systems based on available tools for fixed-structure controller synthesis. We start by transforming a model reduction problem into an equivalent controller synthesis problem by defining an appropriate generalized plant. The controller synthesis problem is then solved by using gradient-based tools available in the literature. Owing to the flexibility of the gradient-based synthesis tools, we are able to impose a desired structure on the obtained reduced model. Additionally, we obtain a bound on the approximation error as a direct output of the optimization problem. The proposed methods are applied on a benchmark mechanical system of interconnected masses, springs and dampers. To evaluate the effect of the proposed model-reduction approach on controller design, LPV controllers designed using the reduced models (with and without an imposed structure) are compared in closed-loop with the original model.
Open AccessTransformation-Free Fixed-Structure Model Reduction for LPV Systems
In this paper, we propose a model reduction technique for linear parameter varying (LPV) systems based on available tools for fixed-structure controller synthesis. We start by transforming a model reduction problem into an equivalent controller synthesis problem by defining an appropriate generalized plant. The controller synthesis problem is then solved by using gradient-based tools available in the literature. Owing to the flexibility of the gradient-based synthesis tools, we are able to impose a desired structure on the obtained reduced model. Additionally, we obtain a bound on the approximation error as a direct output of the optimization problem. The proposed methods are applied on a benchmark mechanical system of interconnected masses, springs and dampers. To evaluate the effect of the proposed model-reduction approach on controller design, LPV controllers designed using the reduced models (with and without an imposed structure) are compared in closed-loop with the original model.
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5676-5681
On Stability Analysis of Predictive Flocking Using N-Paths
Most publications in the field of model predictive flocking (MPF) present frameworks without providing stability analyses for the proposed schemes. In those providing stability results, one specific line of reasoning is based on the geometric properties of the optimal state sequences, so-called $N$ -paths. This method is used in several publications to show stability for centralized and distributed MPF schemes. In this paper, we critically discuss this line of reasoning and point out several errors in the $N$ -path-based analysis. As incorrect statements in assumptions and lemmas cause the lines of reasoning to break, this raises the question of whether the N-path-based line of reasoning is suitable for the MPF stability analysis in general.- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5676-5681
On Stability Analysis of Predictive Flocking Using N-Paths
Most publications in the field of model predictive flocking (MPF) present frameworks without providing stability analyses for the proposed schemes. In those providing stability results, one specific line of reasoning is based on the geometric properties of the optimal state sequences, so-called $N$ -paths. This method is used in several publications to show stability for centralized and distributed MPF schemes. In this paper, we critically discuss this line of reasoning and point out several errors in the $N$ -path-based analysis. As incorrect statements in assumptions and lemmas cause the lines of reasoning to break, this raises the question of whether the N-path-based line of reasoning is suitable for the MPF stability analysis in general.