Fuel-optimal G-MPSP Guidance for Powered Descent Phase of Soft Lunar Landing

A fuel optimal nonlinear sub-optimal guidance scheme is presented in this paper for soft landing of a lunar craft during the powered descent phase. The recently developed Generalized Model Predictive Static Programming (G-MPSP) is used to compute the required magnitude and angle of the thrust vector. Both terminal position and velocity vector are imposed as hard constraints, which ensures high position accuracy and facilitates initiation of vertical descent at the end of the powered descent phase. A key feature of the G-MPSP algorithm is that it converts the nonlinear dynamic programming problem into a low-dimensional static optimization problem (of the same dimension as the output vector). The control history update is done in closed form after computing a time-varying weighting matrix through a backward integration process. This feature makes the algorithm computationally efficient, which makes it suitable for on-board applications. The effectiveness of the proposed guidance algorithm is demonstrated through promising simulation results.

Optimal Guidance for Accurate Lunar Soft Landing with Minimum Fuel Consumption using Model Predictive Static Programming

In this paper the soft lunar landing with minimum fuel expenditure is formulated as a nonlinear optimal guidance problem. The realization of pinpoint soft landing with terminal velocity and position constraints is achieved using Model Predictive Static Programming (MPSP). The high accuracy of the terminal conditions is ensured as the formulation of the MPSP inherently poses final conditions as a set of hard constraints. The computational efficiency and fast convergence make the MPSP preferable for fixed final time onboard optimal guidance algorithm. It has also been observed that the minimum fuel requirement strongly depends on the choice of the final time (a critical point that is not given due importance in many literature). Hence, to optimally select the final time, a neural network is used to learn the mapping between various initial conditions in the domain of interest and the corresponding optimal flight time. To generate the training data set, the optimal final time is computed offline using a gradient based optimization technique. The effectiveness of the proposed method is demonstrated with rigorous simulation results.