Fast numerical computation of Lissajous and quasi-halo libration point trajectories

Abstract

In this paper we present a methodology for the automatic generation of quasi–periodic libration point trajectories (Lissajous and quasi–halo) of the Spatial, Circular Restricted Three–Body Problem. This methodology is based on the computation of a mesh of orbits which, using interpolation strategies, gives an accurate quantitative representation of the full set of libration point orbits. This representation, when combined with the one obtained using Poincar´e maps, provides a useful tool for the design of missions to libration points fulfilling specific requirements. The same methodology applies to stable and unstable manifolds as well. This paper extends and improves results presented in [10].