Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method
arxiv(2024)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要