Fast Trajectory Optimization via Successive Convexification for Spacecraft Rendezvous with Integer Constraints
Fast Trajectory Optimization via Successive Convexification for Spacecraft Rendezvous with Integer Constraints
复制标题
具有整数约束的航天器交会的连续凸化快速轨迹优化
DOI：
10.2514/6.2020-0616
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
M. Mesbahi
中科院分区：
文献类型：
--
作者：
Danylo Malyuta;Taylor P. Reynolds;Michael Szmuk;Behçet Açikmese;M. Mesbahi
本文提出了一种基于连续凸化的混合整数约束下航天器燃料优化交会轨迹生成的快速方法。最近开发的状态触发约束范式允许有效地将离散决策约束子集嵌入到连续凸化的连续优化框架中。因此，我们能够以交互速度解决困难的轨迹优化问题，而不是需要更多解决时间和计算能力的混合整数规划方法。将该方法应用于阿波罗指挥服务舱与登月舱的换位对接实际问题。我们证明，与非优化的阿波罗时代设计目标相比，在几秒钟内，我们能够获得高达90%的燃油效率（节省高达45公斤的燃料）的轨迹。我们的轨迹明确考虑了最小推力脉冲宽度和羽流撞击约束。这两个约束都是天然的混合整数，但我们将它们作为状态触发的约束来处理。在目前的状态下，我们的算法将作为一个有用的离线设计工具，用于快速轨迹贸易研究。
In this paper we present a fast method based on successive convexification for generating fuel-optimized spacecraft rendezvous trajectories in the presence of mixed-integer constraints. A recently developed paradigm of state-triggered constraints allows to efficiently embed a subset of discrete decision constraints into the continuous optimization framework of successive convexification. As a result, we are able to solve difficult trajectory optimization problems at interactive speeds, as opposed to a mixed-integer programming approach that would require significantly more solution time and computing power. Our method is applied to the real problem of transposition and docking of the Apollo command and service module with the lunar module. We demonstrate that, within seconds, we are able to obtain trajectories that are up to 90 percent more fuel efficient (saving up to 45 kg of fuel) than non-optimization based Apollo-era design targets. Our trajectories take explicit account of minimum thrust pulse width and plume impingement constraints. Both of these constraints are naturally mixed-integer, but we handle them as state-triggered constraints. In its current state, our algorithm will serve as a useful off-line design tool for rapid trajectory trade studies.