Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917584164618240 |
|---|---|
| author | Chari, Govind M. Açıkmeşe, Behçet |
| author_facet | Chari, Govind M. Açıkmeşe, Behçet |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_04561 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method Chari, Govind M. Açıkmeşe, Behçet 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. |
| title | Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2402.04561 |