导航

Acta Aeronautica et Astronautica Sinica

Previous Articles     Next Articles

C3 Matching Algorithm for Multiple-Gravity-Assist Trajectory Optimization

Nan ZHANG, ,   

  • Received:2026-03-17 Revised:2026-06-22 Online:2026-06-23 Published:2026-06-23
  • Supported by:
    National Natural Science Foundation of China

Abstract: Multiple-gravity-assist trajectories enable adjustments of orbital energy and flight direction with relatively low propellant consumption, and thus are of significant value in the design of interplanetary missions. To address the C3 matching problem in multiple-gravity-assist trajectory optimization, which is often challenged by low computational efficiency, missing roots, and sensitivity to initial guesses, this paper develops a C3 matching function model based on Lambert transfers, analyzes its solution-space characteristics and domain variation patterns under different transfer conditions, and proposes a C3 matching algorithm that combines analytical gradients with Hermite interpolation. The proposed method reduces the dependence on dense initial guesses by partitioning the function domain, locating root intervals, and accurately computing the roots. Numerical results demonstrate that the proposed method can completely identify all matching solutions, while significantly improving computational efficiency compared with existing methods. Its effectiveness is further demonstrated through the reconstruction of the Voyager 2 trajectory, the optimization of transfer trajectories for Uranus exploration, and applications in the GTOC13 scenario.

Key words: Interplanetary flight, Orbit transfer, Design optimization, Numerical methods, Gravity assist

CLC Number: