2020/11/12 by Aleksandar Petrov, R. Noomen, Petrov, Aleksandar +1
Computer Science · Engineering · #90C27 (Primary) #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Search Problems #Space Satellite Systems and Control #Spacecraft Dynamics and Control
paper · pdf · doi:10.48550/arxiv.2011.06617
openalex publication_date 2020/11/12 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28
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.