Collocation points distributions for optimal spacecraft trajectories

The method of direct collocation with nonlinear programming (DCNLP) is a powerful tool to solve optimal control problems (OCP). In this method the solution time history is approximated with piecewise polynomials, which are constructed using interpolation points deriving from the Jacobi polynomials. Among the Jacobi polynomials family, Legendre and Chebyshev polynomials are the most used, but there is no evidence that they offer the best performance with respect to other family members. By solving different OCPs with interpolation points not only taken within the Jacoby family, the behavior of the Jacobi polynomials in the optimization problems is discussed. This paper focuses on spacecraft trajectories optimization problems. In particular orbit transfers, interplanetary transfers and station keepings are considered.

► We studied optimal control problems applied to space trajectories. ► We used piecewise polynomials to approximate the solution time history. ► We explored different distributions of approximation points. ► There is not a preferred polynomial for the examined optimization problems. ► We found usable sets of polynomial parameters for optimal solutions.