Three-Dimensional Trajectory Optimization of Soft Lunar Landings from the Parking Orbit with Considerations of the Landing Site

Three-Dimensional Trajectory Optimization of Soft Lunar Landings from the Parking Orbit with Considerations of the Landing Site

Minimum fuel, three-dimensional trajectory optimization from a parking orbit considering the desired landing site is addressed for soft lunar landings. The landing site is determined by the final longitude and latitude; therefore, a two-dimensional approach is limited and a three-dimensional approach is required. In addition, the landing site is not usually considered when performing lunar landing trajectory optimizations, but should be considered in order to design more accurate and realistic lunar landing trajectories. A Legendre pseudospectral (PS) method is used to discretize the trajectory op-timization problem as a nonlinear programming (NLP) problem. Because the lunar landing consists of three phases including a de-orbit burn, a transfer orbit phase, and a powered descent phase, the lunar landing problem is regarded as a multiphase problem. Thus, a PS knotting method is also used to man-age the multiphase problem, and C code for Feasible Sequential Quadratic Programming (CFSQP) us-ing a sequential quadratic programming (SQP) algorithm is employed as a numerical solver after for-mulating the problem as an NLP problem. The optimal solutions obtained satisfy all constraints as well as the desired landing site, and the solutions are verified through a feasibility check.

Minimum fuel, three-dimensional trajectory optimization from a parking orbit considering the desired landing site is addressed for soft lunar landings. The landing site is determined by the final longitude and latitude; therefore, a two-dimensional approach is limited and a three-dimensional approach is required. In addition, the landing site is not usually considered when performing lunar landing trajectory optimizations, but should be considered in order to design more accurate and realistic lunar landing trajectories. A Legendre pseudospectral (PS) method is used to discretize the trajectory op-timization problem as a nonlinear programming (NLP) problem. Because the lunar landing consists of three phases including a de-orbit burn, a transfer orbit phase, and a powered descent phase, the lunar landing problem is regarded as a multiphase problem. Thus, a PS knotting method is also used to man-age the multiphase problem, and C code for Feasible Sequential Quadratic Programming (CFSQP) us-ing a sequential quadratic programming (SQP) algorithm is employed as a numerical solver after for-mulating the problem as an NLP problem. The optimal solutions obtained satisfy all constraints as well as the desired landing site, and the solutions are verified through a feasibility check.