SearcharxivSearch

arXiv · 0902.1207

Feedback control of unstable steady states of flow past a flat plate using reduced-order estimators

Abstract

We present an estimator-based control design procedure for flow control, using reduced-order models of the governing equations, linearized about a possibly unstable steady state. The reduced models are obtained using an approximate balanced truncation method that retains the most controllable and observable modes of the system. The original method is valid only for stable linear systems, and we present an extension to unstable linear systems. The dynamics on the unstable subspace are represented by projecting the original equations onto the global unstable eigenmodes, assumed to be small in number. A snapshot-based algorithm is developed, using approximate balanced truncation, for obtaining a reduced-order model of the dynamics on the stable subspace. The proposed algorithm is used to study feedback control of 2-D flow over a flat plate at a low Reynolds number and at large angles of attack, where the natural flow is vortex shedding, though there also exists an unstable steady state. For control design, we derive reduced-order models valid in the neighborhood of this unstable steady state. The actuation is modeled as a localized body force near the leading edge of the flat plate, and the sensors are two velocity measurements in the near-wake of the plate. A reduced-order Kalman filter is developed based on these models and is shown to accurately reconstruct the flow field from the sensor measurements, and the resulting estimator-based control is shown to stabilize the unstable steady state. For small perturbations of the steady state, the model accurately predicts the response of the full simulation. Furthermore, the resulting controller is even able to suppress the stable periodic vortex shedding, where the nonlinear effects are strong, thus implying a large domain of attraction of the stabilized steady state.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sunil Ahuja, Clarence W. Rowley. 2009-02-07. Feedback control of unstable steady states of flow past a flat plate using reduced-order estimators. https://doi.org/10.1017/s0022112009992655

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC