Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method
Year: 2024
Type: preprint
Abstract: We implement a fully factorization-free algorithm for nonconvex, free-final-time trajectory optimization. This algorithm is based on sequential convex programming and utilizes an inverse-free, exact discretization procedure to ensure dynamic feasibility of the converged trajectory and PIPG, a fast, first-order conic optimization algorithm as the subproblem solver. Although PIPG requires the tuning of a hyperparameter to achieve fastest convergence, we show that PIPG can be tuned to a nominal trajectory optimization problem and it is robust to variations in initial condition. We demonstrate this with a monte carlo simulation of the free-final-time rendezvous problem, using Clohessy-Wiltshire dynamics, an impulsive thrust model, and various state and control constraints including a spherical keepout zone.
Source: arXiv (Cornell University)
Authors: Chari, Govind M., Açıkmeşe, Behçet
Institution: University of Washington
Language: English
Subfield: Aerospace Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
Funder: Office of Naval Research
Awards: G2604845354, G8876996369
OpenAlex ID: W4391673215