弹道
终端(电信)
控制理论(社会学)
约束(计算机辅助设计)
职位(财务)
离散化
水准点(测量)
末制导
轨迹优化
路径(计算)
点(几何)
最优控制
数学优化
内点法
计算机科学
缩小
工程类
控制(管理)
最优化问题
控制器(灌溉)
燃料效率
津贴(工程)
车辆动力学
推力
推进剂
数学
弹道导弹
计算复杂性理论
导弹制导
点对点
作者
김민겸,Changhyun Kang,이도현,Byeong-Un Jo
标识
DOI:10.48550/arxiv.2609.28759
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI