Direct Methods

Author: Tianjiang Shuo

Website: https://cislunarspace.cn

Definition

A class of numerical methods for trajectory optimization that discretizes trajectory and control variables and solves the resulting problem via nonlinear programming. Direct methods transform infinite-dimensional optimal control problems into finite-dimensional nonlinear programming problems, solved by sequential quadratic programming or interior-point methods, with convergence dependent on the quality of the initial guess.

Application Value

Direct methods transform infinite-dimensional optimal control into finite nonlinear programming, solved via SQP or interior-point methods with convergence dependent on initial guess quality.

References

  • Vellutini & Avanzini, 2014, Shape-based design of low-thrust trajectories to cislunar lagrangian point
Improve this page
Last Updated:
Contributors: ouyangjiahong, Ou Yang Jiahong