Convex Trajectory Optimization via Monomial Coordinates Transcription for Cislunar Rendezvous

Abstract: This paper proposes a nonlinear guidance algorithm for fuel-optimal impulsive trajectories for rendezvous operations close to a reference orbit. The approach involves overparameterized monomial coordinates and a high-order approximation of the dynamic flow precomputed using Differential Algebra, which eliminates the need for real-time integration. To address non-convexity in the monomial coordinate formulation of the guidance problem, Sequential Convex Programming is applied. Using the methodology presented in this paper, repeatedly evaluating the nonlinear dynamics is not necessary, as in shooting or collocation methods. Instead, only the monomial equations require updating between iterations, drastically reducing computational burden. The proposed algorithm is tested in the Circular Restricted Three-Body Problem framework with the target spacecraft on a Near-Rectilinear Halo Orbit. The results demonstrate stability, efficiency, and low computational demand while achieving minimal terminal guidance errors. Compared to linear methods, this nonlinear convex approach exhibits superior performance in open-loop propagation of impulsive maneuvers in cislunar space, particularly in terms of accuracy. These advantages make the algorithm an attractive candidate for autonomous onboard guidance for rendezvous operations in the cislunar domain.