تقرير
Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method
| العنوان: | Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method |
|---|---|
| المؤلفون: | Chari, Govind M., Açıkmeşe, Behçet |
| سنة النشر: | 2024 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Optimization and Control |
| الوصف: | 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. Comment: AAS Rocky Mountain Guidance, Navigation and Control Conference, 2024 |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2402.04561 |
| رقم الأكسشن: | edsarx.2402.04561 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |