Global Trajectory Optimization of Multispacecraft Successive Rendezvous Using Multitree Search

Abstract

This paper investigates the global optimization of multispacecraft successive rendezvous trajectories, which is divided here into three subproblems: target assignment, sequence optimization, and rendezvous time optimization. A method consisting of two novel algorithms is proposed to solve these subproblems. First, a multitree search framework is developed to assign multiple targets to each spacecraft and simultaneously optimize the rendezvous sequence for every single spacecraft. Specifically, a novel algorithm of local search combined with beam search is proposed. Second, this paper converts the rendezvous time optimization problem into a multistage decision problem. Based on a critical rendezvous-epoch-dependent characteristic found in this subproblem, the number of state variables is thereby reduced. A novel dual dynamic programming algorithm is proposed and combined with dynamic programming to solve for the globally optimal rendezvous epochs efficiently. Global optimality is guaranteed by Bellman’s principle of optimality, which is the first time in such a problem to our knowledge. The proposed method achieves state-of-the-art performance in several typical fuel-optimal scenarios of active debris removal. This open-sourced method is non-database-dependent and contains only one design stage, which is expected to be adopted in other successive rendezvous missions.