Trajectory optimization of flybys of multiple irregular satellites of Jupiter with Galilean moons gravity assist

Abstract

The irregular satellites within the Jupiter system hold high scientific value due to their potential to contain clues about the early evolution of the solar system. This paper proposes an optimization algorithm for multiple irregular satellites flyby trajectories, which includes the powered gravity assist from Galilean moons. The algorithm is based on beam search and uses virtual trajectories to determine potential flyby targets, solving for trajectories that satisfy constraints on velocity increment, mission duration, and perijove radius. By changing the initial orbital period and optimizing the number of branches with Galilean moon gravity assist during branching, and comparing with the case without Galilean moon gravity assist, the effects of these factors on the number of irregular satellite flybys are summarized. The simulation results show that the algorithm can effectively solve for orbits that flyby multiple irregular satellites for initial orbits of different periods. The three trajectories obtained can serve as references for future missions.