论文标题
优化多汇款航天器轨迹：$ΔV$矩阵和序列选择
Optimizing multi-rendezvous spacecraft trajectories: $ΔV$ matrices and sequence selection
论文作者
论文摘要
众所周知，难以解决多汇款航天器轨迹优化问题。因此，通常通过使用启发式和过去的经验来修剪设计空间。作为替代方案，当前的研究探讨了$ΔV$矩阵的某些属性，这些属性为在不同的出发时间和传递持续时间值的两个天体之间的传递提供了最小$ΔV$值。这些可以以自动化的方式有助于解决多汇款问题。该论文的重点是给定一组候选对象的问题，如何找到$ n $对象的顺序以汇合，以最大程度地减少所需的$ΔV$。传输被认为是对应于$ΔV$矩阵的单个代数对象，可以通过广义求和来直观串联。由于任务要求以及更便宜和更快的未来转移的前景，等待时间也已纳入$ΔV$矩阵中。该问题作为图表上最短路径搜索的转录可以利用一系列可用的有效最短路径求解器。鉴于有效的$ΔV$矩阵估计器，据信这里提出的新范式可提供当前使用的修剪技术的替代方法。
Multi-rendezvous spacecraft trajectory optimization problems are notoriously difficult to solve. For this reason, the design space is usually pruned by using heuristics and past experience. As an alternative, the current research explores some properties of $ΔV$ matrices which provide the minimum $ΔV$ values for a transfer between two celestial bodies for various times of departure and transfer duration values. These can assist in solving multi-rendezvous problems in an automated way. The paper focuses on the problem of, given a set of candidate objects, how to find the sequence of $N$ objects to rendezvous with that minimizes the total $ΔV$ required. Transfers are considered as single algebraic objects corresponding to $ΔV$ matrices, which allow intuitive concatenation via a generalized summation. Waiting times, both due to mission requirements and prospects for cheaper and faster future transfers, are also incorporated in the $ΔV$ matrices. A transcription of the problem as a shortest path search on a graph can utilize a range of available efficient shortest path solvers. Given an efficient $ΔV$ matrix estimator, the new paradigm proposed here is believed to offer an alternative to the pruning techniques currently used.
