Arbitrarily Tight Bounds on a Singularly Perturbed Linear-Quadratic Optimal Control Problem
Abstract
We calculate arbitrarily tight upper and lower bounds on an unconstrained control, linear-quadratic, singularly perturbed optimal control problem whose exact solution is computationally intractable. It is well known that for the aforementioned problem, an approximate solution VN(ε) can be constructed such that it is asymptotically equivalent in ε to the solution V(ε) of the singularly perturbed problem in the sense that |V(ε)-VN(ε)| =O(εN+1) for any integer N≥0 as ε → 0. For this approximation to be considered useful, the parameter ε is typically restricted to be in some sufficiently small set; however, for values of ε outside this set, a poor approximation can result. We improve on this approximation by incorporating a duality theory into the singularly perturbed optimal control problem and derive an upper bound Nu(ε) and a lower bound Nl(ε) of V(ε) that hold for arbitrary ε and, furthermore, satisfy the inequality |Nu(ε)-Nl(ε)|=O(εN+1) for any integer N ≥ 0 as ε → 0.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.