Abstract
A pseudospectral method for solving nonlinear optimal control problems is proposed in this thesis. The method is a direct transcription that transcribes the continuous optimal control problem into a discrete nonlinear programming problem (NLP), which can be solved by well-developed algorithms. The method is based on using global polynomial approximations to the dynamic equations at a set of Gauss collocation points. The optimality conditions of the NLP have been found to be equivalent to the discretized optimality conditions of the continuous control problem, which is not true of other pseudospectral methods. This result indicates that the method can take advantage of the properties of both direct and indirect formulations, and allows for the costates to be estimated directly from the Lagrange multipliers of the NLP. The method has been shown empirically to have very fast convergence (exponential) in the states, controls, and costates, for problems with analytic solutions. This convergence rate of the proposed method is significantly faster than traditional finite difference methods, and has been demonstrated with many example problems. The initial costate estimate from the proposed method can be used to define an optimal feedback law for real time optimal control of nonlinear problems. The application and effectiveness of this approach has been demonstrated with the simulated trajectory optimization of a launch vehicle.
Author supplied keywords
Cite
CITATION STYLE
Benson, D. A. (2005). A gauss Pseudospectral Transcription for Optimal Control. MIT Libraries, 111–123.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.