Trajectory design via unsupervised probabilistic learning on optimal manifolds
This article illustrates the use of unsupervised probabilistic learning techniques for the analysis of planetary reentry trajectories. A three-degree-of-freedom model was employed to generate optimal trajectories that comprise the training datasets. The algorithm first extracts the intrinsic structure in the data via a diffusion map approach. We find that data resides on manifolds of much lower dimensionality compared to the high-dimensional state space that describes each trajectory. Using the diffusion coordinates on the graph of training samples, the probabilistic framework subsequently augments the original data with samples that are statistically consistent with the original set. The augmented samples are then used to construct conditional statistics that are ultimately assembled in a path planning algorithm. In this framework, the controls are determined stage by stage during the flight to adapt to changing mission objectives in real-time.
- Research Organization:
- Sandia National Laboratories (SNL-CA), Livermore, CA (United States); Sandia National Laboratories,, Albuquerque, NM
- Sponsoring Organization:
- USDOE; USDOE Laboratory Directed Research and Development (LDRD) Program; USDOE National Nuclear Security Administration (NNSA)
- Grant/Contract Number:
- NA0003525
- OSTI ID:
- 1882958
- Alternate ID(s):
- OSTI ID: 1887411
- Report Number(s):
- SAND2022-11950J; e26; PII: S2632673622000260
- Journal Information:
- Data-Centric Engineering, Journal Name: Data-Centric Engineering Vol. 3; ISSN 2632-6736
- Publisher:
- Cambridge University Press (CUP)Copyright Statement
- Country of Publication:
- United Kingdom
- Language:
- English
Similar Records
Entropy-based closure for probabilistic learning on manifolds