Content area
Moon exploration has gathered renewed global interest in recent years. As the exploration of the Moon continues, lunar operations such as resupply and crew transfer missions will require spacecraft that can lift off from the surface of the Moon to a target orbit. To increase the efficiency of such missions, designing an optimal ascent trajectory is essential.
This thesis presents a convex approach for optimizing the ascent trajectory of a lunar ascent vehicle. Traditional trajectory optimization methods often struggle with the non-convex nature of the dynamics and constraints of the ascent trajectory. To address this issue, convex optimization approach is proposed. By combining lossless and successive convexification methods, the non-convex ascent problem is transformed into a series of convex subproblems that can be efficiently solved to generate an optimal trajectory to reach the mission orbit.
The main contribution of this study is the formulation of novel terminal constraints that use three orbital vectors, which are the specific angular momentum, the node line, and the eccentricity vectors, to capture five of the six orbital elements, allowing for accurate targeting of the designated mission orbit while leaving the true anomaly parameter free to simplify the optimization process and improve solver performance. Previous studies on convex ascent trajectory optimization have mainly focused on reaching circular orbits. The proposed approach generalizes the terminal constraints and extends available methods to enable targeting of a wider range of orbits, including elliptic orbits.