SearcharxivSearch

arXiv · 2609.13459

Data-Driven Flutter Suppression via HODMD, DMDcand Constrained MPC

Abstract

This work presents an interpretable data-to-control framework for actuator-constrained flutter suppression by combining higher-order dynamic mode decomposition (HODMD), dynamic mode decomposition with control (DMDc), and model predictive control (MPC). The primary case is a pitch-plunge typical section with a trailing-edge flap and rational unsteady aerodynamics. HODMD identifies the dominant frequency and growth rate in subcritical, near-critical, and post-critical regimes from four measured structural channels. With 2% RMS sensor noise, the near-critical growth-rate error is 1.8 x 10^-3 s^-1, substantially lower than with standard DMD without delay embedding. A five-state real reduced-order model is formed from the HODMD subspace, and its flap-input matrix is estimated from a small-amplitude PRBS record using DMDc. For an independent chirp input, the normalized error over all channels is 2.4 x 10^-3. The constrained MPC stabilizes the true post-critical plant for an initial pitch perturbation of 8 degrees with a flap limit of 1 degree, whereas saturated LQR designed from the same model reaches the prescribed validity limit. Three supporting studies assess transferability. SU2 simulations show HODMD frequency recovery consistent with the available spectral resolution; OpenFOAM dynamic-mesh calculations show nearly linear articulated-flap moment authority from 2 to 8 degrees with frequency-dependent gain; and a two-way SU2 Python-FSI case demonstrates bounded disturbance rejection using a proportional-derivative baseline. These studies support modal identification, actuator authority, and closed-loop feasibility, but are not presented as CFD-level MPC validation. The framework provides a reproducible route from early-time measurements to constrained aeroelastic control.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carlos Mendez. 2026-09-11. Data-Driven Flutter Suppression via HODMD, DMDcand Constrained MPC. https://arxiv.org/abs/2609.13459

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Operational Impact of Registry size, Cycle length, and Blood Type Distribution in Multi-Registry Kidney Exchange Programs

Kidney exchange programs address donor recipient incompatibility by exchanging donors between incompatible pairs, but single center KEPs often suffer from limited donor pools, which reduce matching efficiency. Multi registry kidney exchange programs offer a promising solution but face challenges, including heterogeneous constraints across registries, cycle-length bounds, and data-sharing limitations. This study uses simulation to compare mKEP allocation against individual registry operation, contrasting unconstrained pooling with two safeguarded mechanisms: a cumulative individual-rationality guarantee and a Shapley value based fair-share mechanism. We examine how registry size, blood-type distribution, cycle-length bounds, and dropout probability affect the size and distribution of achievable gain. Our central finding is that the benefit of joining an mKEP is systematically uneven: under blood group composition asymmetry, the easier-to-match registry gains less than its partner even under both safeguarded mechanisms, and a larger registry gains less than a smaller one when pooled. A registry combining a larger arrival rate with an easier-to-match pool may see its gain under either safeguarded mechanism fall too small to be practically significant, while registries with a higher dropout rate see a larger benefit from pooling. This unevenness concentrates in O-type recipients: an easier-to-match registry sees fewer O-type transplants within itself under pooling, though O-type transplant rates rise system-wide. Tighter cycle-length bounds increase, rather than diminish, the relative transplant-volume benefit of pooling, while match quality is only modestly affected by any factor examined. These results highlight the importance of pairing multi-registry collaboration with a carefully designed, equitable benefit-sharing mechanism to keep participation attractive for all registries involved.

math.OC

A polynomial approximation scheme for nonlinear model reduction by moment matching

We propose a procedure for the numerical approximation of invariance equations arising in the moment matching technique associated with reduced-order modeling of high-dimensional dynamical systems. The Galerkin residual method is employed to find an approximate solution to the invariance equation using a Newton iteration on the coefficients of a monomial basis expansion of the solution. These solutions to the invariance equations can then be used to construct reduced-order models. We assess the ability of the method to solve the invariance PDE system as well as to achieve moment matching and recover the steady-state behaviour of nonlinear systems with state dimension of order 1000 driven by linear and nonlinear signal generators.

math.OC

Computationally Efficient Density-Driven Optimal Control via Analytical KKT Reduction and Contractive MPC

Efficient coordination for collective spatial distribution is a fundamental challenge in multi-agent systems. Prior research on Density-Driven Optimal Control (D2OC) established a framework to match agent trajectories to a desired spatial distribution. However, implementing this as a predictive controller requires solving a large-scale Karush-Kuhn-Tucker (KKT) system, whose computational complexity grows cubically with the prediction horizon. To resolve this, we propose an analytical structural reduction that transforms the T-horizon KKT system into a condensed quadratic program (QP). This formulation achieves O(T) linear scalability, significantly reducing the online computational burden compared to conventional O(T^3) approaches. Furthermore, to ensure rigorous convergence in dynamic environments, we incorporate a contractive Lyapunov constraint and prove the Input-to-State Stability (ISS) of the closed-loop system against reference propagation drift. Numerical simulations verify that the proposed method facilitates rapid density coverage with substantial computational speed-up, enabling long-horizon predictive control for large-scale multi-agent swarms.

math.OC