SearcharxivSearch

arXiv · 1906.05434

Folding Bilateral Backstepping Output-Feedback Control Design For an Unstable Parabolic PDE

Abstract

We present a novel methodology for designing output-feedback backstepping boundary controllers for an unstable 1-D diffusion-reaction partial differential equation with spatially-varying reaction. Using "folding" transforms the parabolic PDE into a 2X2 coupled parabolic PDE system with coupling via folding boundary conditions. The folding approach is novel in the sense that the design of bilateral controllers can be generalized to centering around arbitrary points, which admit additional design parameters for both the state-feedback controller and the state observer. The design can be selectively biased to achieve different performance indicies (e.g. energy, boundedness, etc). A first backstepping transformation is designed to map the unstable system into a strict-feedback intermediate target system. A second backstepping transformation is designed to stabilize the intermediate target system. The invertibility of the two transformations guarantees that the derived state-feedback controllers exponentially stabilize the trivial solution of the parabolic PDE system in the L^2 norm sense. A complementary state observer is likewise designed for the dual problem, where two collocated measurements are considered at an arbitrary point in the interior of the domain. The observer generates state estimates which converge to the true state exponentially fast in the L^2 sense. Finally, the output feedback control law is formulated by composing the state-feedback controller with the state estimates from the observer, and the resulting dynamic feedback is shown to stabilize the trivial solution of the interconnected system in the L^2 norm sense. Some analysis on how the selection of these points affect the responses of the controller and observer are discussed, with simulations illustrating various choices of folding points and their effect on the stabilization.

Explore related subjects

Keep this discovery

BibTeXRIS

Stephen Chen, Rafael Vazquez, Miroslav Krstic. 2019-06-13. Folding Bilateral Backstepping Output-Feedback Control Design For an Unstable Parabolic PDE. https://arxiv.org/abs/1906.05434

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