arXiv (All)
open access
Fuel-optimal Boost-Back Guidance via Successive Convexification with a Terminal Constraint for ReusableLaunch Vehicles
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convex Programming Approach of Robust Powered Descent Guidance through Dynamic Tube MPC#433623
- Tannenbaum's gain-margin optimization meets Polyak's heavy-ball algorithm#986097
- A Simplified Backstepping Design for 3D Time-based Aircraft Relative Guidance#253916
- Exact Truncation and Radial Rigidity in Time-Optimal Control#1037485
- On the Value Function for a Class of Set Motion Problems#1130975
Record · ID 1076415
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive