A Low-Complexity Algorithm to Determine Trajectories Within the Circular Restricted Three-Body Problem

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 intro...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the astronautical sciences Vol. 70; no. 6; p. 46
Main Authors: Canales, David, Perera, Sirani M., Kurttisi, Atahan, Baker-McEvilly, Brian
Format: Journal Article
Language:English
Published: New York Springer US 07.11.2023
Springer Nature B.V
Subjects:
Accuracy
Aerospace Technology and Astronautics
Algorithms
Boundary conditions
Complexity
Cost control
Engineering
Equilibrium
Iterative methods
Mathematical Applications in the Physical Sciences
Moon
Numerical analysis
Orbits
Original Article
Propagation
Retrograde orbits
Space Exploration and Astronautics
Space Sciences (including Extraterrestrial Physics
Spacecraft
Three body problem
Trajectories
India
Low-complexity algorithm
Periodic orbits
Navigation
Cislunar realm
Three-body problem
ISSN:2195-0571, 0021-9142, 2195-0571
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2195-0571
0021-9142
2195-0571
DOI:10.1007/s40295-023-00416-5