Galerkin Optimal Control

Abstract

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington ABSTRACT (maximum 200 words)A Galerkin-based family of numerical formulations is presented for solving nonlinear optimal control problems. This dissertation introduces a family of direct methods that calculate optimal trajectories by discretizing the system dynamics using Galerkin numerical techniques and approximate the cost function with Gaussian quadrature. In this numerical approach, the analysis is based on L 2 -norms. An important result in the theoretical foundation is that the feasibility and consistency theorems are proved for problems with continuous and/or piecewise continuous controls. Galerkin methods may be formulated in a number of ways that allow for efficiency and/or improved accuracy while solving a wide range of optimal control problems with a variety of state and control constraints. Numerical formulations using Lagrangian and Legendre test functions are derived. One formulation allows for a weak enforcement of boundary conditions, which imposes end conditions only up to the accuracy of the numerical approximation itself. Additionally, the multi-scale formulation can reduce the dimension of multi-scale optimal control problems, those in which the states and controls evolve on different timescales. Finally, numerical examples are shown to demonstrate the versatile nature of Galerkin optimal control. SUBJECT TERMS

Convergence Results of Galerkin Optimal Control with Legendre Test Function∗∗The work and views expressed in this paper are those of the authors and do not reflect the oficial policy or position of the U.S. Department of the Army, the U.S. Department of the Navy, the U.S. Department of Defense or the U.S. Government.

“…The Galerkin formulation with weak imposition of endpoint conditions may also allow for problem discretizations with other than Legendre-Gauss-Lobatto (LGL) nodes, such as Legendre-Gauss (LG) and LegendreGauss-Radau (LGR) points. This is discussed in some detail in Boucher (2015).…”

“…For the reason of space, the feasibility of the computational strategy is not proved in this paper. However, some similar proofs are provided in Boucher (2015) as reference.…”

Adaptively Receding Galerkin Optimal Control for a Nonlinear Boiler‐Turbine Unit

“…where y p = y + d is the practical output and y m is the output of an independent model. Here, the independent model is simply defined as the same as models (18), (19), (20), (21), (22), and (23). To this end, the estimated disturbancesd are fed back instead of d in (33) to implement the receding Galerkin method.…”

“…In this way, the estimate error e will just approach zero. (27) do in fact exist by selecting appropriate feasibility tolerance δ N and the order of approximation N, as remarked in [21,23]. Precise bounds for δ N can be found experimentally using a recursive refinement process through increasing the order of approximation N until all the constraints in a nonlinear programming problem like (27) are satisfied.…”

“…The main difficulty arises in seeking a closed-form solution to the Hamilton-Jacobi equation or in solving the canonical Hamiltonian equations resulting from an application of the minimum principle [21]. Alternatively, a Galerkin pseudospectral method [22,23] is one of the most efficient computational approaches, intending to solve the optimal state and control sequences through transforming the state-and controlconstrained nonlinear optimal control problems into a nonlinear programming problem [18,24]. There are some obstacles on the path to design a Galerkin optimal controller to make the unit track large-scale load demand/reference.…”