Metraipolis › archive › dc_a57f53ebb7cc

Fuel-optimal Boost-Back Guidance via Successive Convexification with a Terminal Constraint for ReusableLaunch Vehicles — arXiv:2609.28759

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.28759
License (as archived)
CC0-1.0
Archived
2026-10-08T06:07:13.536Z
SHA-256 of the archived text
0ca6429cfd6f076ee365631b170c65e83bd91d2ff1c90d424f50faaaae8d21a3
Stable URL of this page
https://metraipolis.com/documento/dc_a57f53ebb7cc

How to cite

Fuel-optimal Boost-Back Guidance via Successive Convexification with a Terminal Constraint for ReusableLaunch Vehicles — arXiv:2609.28759 — arXiv (en), https://arxiv.org/abs/2609.28759 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a57f53ebb7cc (Metraipolis archive dc_a57f53ebb7cc, sha256 0ca6429cfd6f076ee365631b170c65e83bd91d2ff1c90d424f50faaaae8d21a3)
BibTeX
@misc{dca57f53ebb7cc,
  title = {Fuel-optimal Boost-Back Guidance via Successive Convexification with a Terminal Constraint for ReusableLaunch Vehicles — arXiv:2609.28759},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.28759},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a57f53ebb7cc; sha256 0ca6429cfd6f076ee365631b170c65e83bd91d2ff1c90d424f50faaaae8d21a3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28759. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper proposes a fuel-optimal boost-back guidance algorithm for reusable launch vehicles using successive convexification (SCvx). The guidance problem is formulated as a free-final-time optimal control problem with a terminal instantaneous impact point (IIP) constraint. This constraint depends only on the burnout position and velocity and enforces that the predicted ballistic impact point coincides with the target under a spherical-Earth, central-gravity model. By handling the coast analytically, the formulation confines trajectory discretization to the powered phase, reduces the problem size, and explicitly represents the bang-off structure. It also avoids the accumulation of discretization defects over the long coast and the need to resolve the burn-coast transition on a single-phase grid. Two terminal constraint formulations are considered: the closed-form Keplerian IIP and the eccentric-anomaly-based F&G solution. Their Jacobians are evaluated using complex-step differentiation. The algorithm is validated in a return-to-launch-site case study based on the Falcon 9 CRS-10 mission. Comparisons with a single-phase full-trajectory formulation, a closed-form guidance law incorporating the flight path angle rate, and an offline trajectory optimization benchmark assess the trade-off between computational cost and optimality. The results demonstrate near-optimal propellant consumption with reduced computational cost.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.28759 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T05:31:31.120Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).