Convergence rate for a Gauss collocation method applied to unconstrained optimal control

Abstract

A local convergence rate is established for an orthogonal collocation method based on Gauss quadrature applied to an unconstrained optimal control problem. If the continuous problem has a sufficiently smooth solution and the Hamiltonian satisfies a strong convexity condition, then the discrete problem possesses a local minimizer in a neighborhood of the continuous solution, and as the number of collocation points increases, the discrete solution convergences exponentially fast in the sup-norm to the continuous solution. This is the first convergence rate result for an orthogonal collocation method based on global polynomials applied to an optimal control problem.

Cited by in corpus (6)

• Fuel-Efficient Powered Descent Guidance on Large Planetary Bodies via Theory of Functional Connections
• Method for Solving Bang-Bang and Singular Optimal Control Problems using Adaptive Radau Collocation
• Convergence rate for a Gauss collocation method applied to constrained optimal control
• Convergence Rate for a Radau hp Collocation Method Applied to Constrained Optimal Control
• Lebesgue Constants Arising in a Class of Collocation Methods
• Comparison of Derivative Estimation Methods in Solving Optimal Control Problems Using Direct Collocation