With the growing volume of traffic within the Cislunar region, there is an increasing need for efficient techniques to propagate trajectories of spacecraft in the circular restricted three-body problem. A low-complexity algorithm utilizing interpolation and incorporating boundary conditions is introduced for generating accurate trajectories and periodic orbits within the Cislunar domain. The proposed approach offers a distinct advantage over existing iterative techniques, as it yields favorable results in terms of arithmetic and time complexities. Once the reliable low-complexity algorithm is developed, it is applied to relevant Cislunar trajectories. Finally, we have compared the time complexity of the proposed algorithm with that of a traditional orbit propagator. The algorithm achieves significant improvements in time complexity for various types of orbital trajectories compared to traditional iterative methods. It demonstrates approximately a 50% enhancement of time efficiency for low-Lunar, Lyapunov, near-rectilinear halo, and distant retrograde orbital trajectories.

随着地月区域内交通量的不断增长，越来越需要有效的技术来传播圆形受限三体问题中的航天器轨迹。引入了一种利用插值和合并边界条件的低复杂度算法，用于在地月域内生成精确的轨迹和周期轨道。所提出的方法比现有的迭代技术具有明显的优势，因为它在算术和时间复杂度方面产生了良好的结果。一旦开发出可靠的低复杂度算法，就会将其应用于相关的地月轨道。最后，我们将所提出算法的时间复杂度与传统轨道传播器的时间复杂度进行了比较。与传统的迭代方法相比，该算法对于各类轨道轨迹的时间复杂度都有显着的提高。它证明了低月轨道、李亚普诺夫轨道、近直线晕轨道和远逆行轨道的时间效率提高了约 50%。