Improving Computational Efficiency for Powered Descent Guidance via Transformer-based Tight Constraint Prediction
This work addresses efficiency in spacecraft guidance for aerospace applications, representing an incremental improvement by applying a known neural network method to a specific domain problem.
The paper tackles the computational complexity of spacecraft powered descent guidance by introducing T-PDG, a transformer-based algorithm that predicts optimal solutions from prior data, reducing trajectory computation time from 1-8 seconds to under 500 milliseconds for Mars landing scenarios.
In this work, we present Transformer-based Powered Descent Guidance (T-PDG), a scalable algorithm for reducing the computational complexity of the direct optimization formulation of the spacecraft powered descent guidance problem. T-PDG uses data from prior runs of trajectory optimization algorithms to train a transformer neural network, which accurately predicts the relationship between problem parameters and the globally optimal solution for the powered descent guidance problem. The solution is encoded as the set of tight constraints corresponding to the constrained minimum-cost trajectory and the optimal final time of landing. By leveraging the attention mechanism of transformer neural networks, large sequences of time series data can be accurately predicted when given only the spacecraft state and landing site parameters. When applied to the real problem of Mars powered descent guidance, T-PDG reduces the time for computing the 3 degree of freedom fuel-optimal trajectory, when compared to lossless convexification, from an order of 1-8 seconds to less than 500 milliseconds. A safe and optimal solution is guaranteed by including a feasibility check in T-PDG before returning the final trajectory.