A Reduced-Complexity Trajectory Generation Algorithm for Three-Body Regimes With Minimum Predefined Data

Computational limitations and Big Data analysis pose challenges in seeking efficient techniques to predict trajectories in three-body dynamics. Thus, a reduced-complexity classical algorithm is proposed utilizing predefined spacecraft's position and velocity data to achieve precise and accurate orbital trajectories of the spacecraft within three-body dynamics. The proposed algorithm seamlessly solves polynomial interpolation along with the boundary and interior conditions without the need for the spacecraft's acceleration data. Once the algorithm is derived, it will be tested across a diverse variety of periodic trajectories in the Earth-Moon system. Moreover, a comparative analysis is performed to evaluate the time complexity of the proposed algorithm compared with conventional orbit propagators. Finally, the proposed algorithm will be utilized and extended to learn and update distant retrograde orbits (DRO) while training a neural network with several initial conditions composing minimum predefined data. After the training is done, the neural network is used to accurately predict DRO trajectories for a given initial condition, demonstrating the exceptional accuracy and effectiveness of the proposed learning process.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Aerospace and Electronic Systems
Published
2024-09-23
DOI
https://doi.org/10.1109/taes.2024.3465502
Citations
1
Primary Topic
Cold Atom Physics and Bose-Einstein Condensates
Type
article
Field-Weighted Citation Impact
0.34
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Reduced-Complexity Trajectory Generation Algorithm for Three-Body Regimes With Minimum Predefined Data

David Canales, Sirani M. Perera, Brian P. Baker-McEvilly, Hansaka Aluvihare
1 citations
IEEE Transactions on Aerospace and Electronic Systems
Cold Atom Physics and Bose-Einstein Condensates
0.34
article

A Reduced-Complexity Trajectory Generation Algorithm for Three-Body Regimes With Minimum Predefined Data

David Canales, Sirani M. Perera, Brian P. Baker-McEvilly, Hansaka Aluvihare
article en
1 citations

Abstract

Computational limitations and Big Data analysis pose challenges in seeking efficient techniques to predict trajectories in three-body dynamics. Thus, a reduced-complexity classical algorithm is proposed utilizing predefined spacecraft's position and velocity data to achieve precise and accurate orbital trajectories of the spacecraft within three-body dynamics. The proposed algorithm seamlessly solves polynomial interpolation along with the boundary and interior conditions without the need for the spacecraft's acceleration data. Once the algorithm is derived, it will be tested across a diverse variety of periodic trajectories in the Earth-Moon system. Moreover, a comparative analysis is performed to evaluate the time complexity of the proposed algorithm compared with conventional orbit propagators. Finally, the proposed algorithm will be utilized and extended to learn and update distant retrograde orbits (DRO) while training a neural network with several initial conditions composing minimum predefined data. After the training is done, the neural network is used to accurately predict DRO trajectories for a given initial condition, demonstrating the exceptional accuracy and effectiveness of the proposed learning process.

IEEE Transactions on Aerospace and Electronic SystemsVol. 61(2)
Embry–Riddle Aeronautical University (US)
Climate action
Openalex Percentile: Top 40%
Cold Atom Physics and Bose-Einstein Condensates
0.34
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.