Article ID: | iaor201526443 |
Volume: | 36 |
Issue: | 4 |
Start Page Number: | 381 |
End Page Number: | 397 |
Publication Date: | Jul 2015 |
Journal: | Optimal Control Applications and Methods |
Authors: | Hager William W, Rao Anil V, Franolin Camila C, Benson David A |
Keywords: | control, heuristics, programming: dynamic |
Two methods are presented for approximating the costate of optimal control problems in integral form using orthogonal collocation at Legendre–Gauss (LG) and Legendre–Gauss–Radau (LGR) points. It is shown that the derivative of the costate of the continuous‐time optimal control problem is equal to the negative of the costate of the integral form of the continuous‐time optimal control problem. Using this continuous‐time relationship between the differential and integral costate, it is shown that the discrete approximations of the differential costate using LG and LGR collocation are related to the corresponding discrete approximations of the integral costate via integration matrices. The approach developed in this paper provides a way to approximate the costate of the original optimal control problem using the Lagrange multipliers of the integral form of the LG and LGR collocation methods. The methods are demonstrated on two examples where it is shown that both the differential and integral costate converge exponentially as a function of the number of LG or LGR points.