Global Search for Optimal Low Thrust Spacecraft Trajectories using Diffusion Models and the Indirect Method

• URL: http://arxiv.org/abs/2501.07005v1
• Date: Mon, 13 Jan 2025 01:49:17 GMT
• Title: Global Search for Optimal Low Thrust Spacecraft Trajectories using Diffusion Models and the Indirect Method
• Authors: Jannik Graebner, Ryne Beeson,
• Abstract summary: Long time-duration low-thrust nonlinear optimal spacecraft trajectory global search is a computationally and time expensive problem. Generative machine learning models can be trained to learn how the solution structure varies with respect to a conditional parameter. State-of-the-art diffusion models are integrated with the indirect approach for trajectory optimization within a global search framework.
• Score: 0.0
• License:
• Abstract: Long time-duration low-thrust nonlinear optimal spacecraft trajectory global search is a computationally and time expensive problem characterized by clustering patterns in locally optimal solutions. During preliminary mission design, mission parameters are subject to frequent changes, necessitating that trajectory designers efficiently generate high-quality control solutions for these new scenarios. Generative machine learning models can be trained to learn how the solution structure varies with respect to a conditional parameter, thereby accelerating the global search for missions with updated parameters. In this work, state-of-the-art diffusion models are integrated with the indirect approach for trajectory optimization within a global search framework. This framework is tested on two low-thrust transfers of different complexity in the circular restricted three-body problem. By generating and analyzing a training data set, we develop mathematical relations and techniques to understand the complex structures in the costate domain of locally optimal solutions for these problems. A diffusion model is trained on this data and successfully accelerates the global search for both problems. The model predicts how the costate solution structure changes, based on the maximum spacecraft thrust magnitude. Warm-starting a numerical solver with diffusion model samples for the costates at the initial time increases the number of solutions generated per minute for problems with unseen thrust magnitudes by one to two orders of magnitude in comparison to samples from a uniform distribution and from an adjoint control transformation.

Related papers

• Global Search of Optimal Spacecraft Trajectories using Amortization and Deep Generative Models [0.5898893619901381]
  We formulate the parameterized global search problem as the task of sampling a conditional probability distribution with support on the neighborhoods of local basins of attraction to the high quality solutions. The approach is benchmarked on a low thrust spacecraft trajectory optimization problem in the circular restricted three-body problem. The paper also provides an in-depth analysis of the multi-modal funnel structure of a low-thrust spacecraft trajectory optimization problem.
  arXiv  Detail & Related papers  (2024-12-28T04:57:12Z)
• Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models [57.45019514036948]
  Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics. This work proposes a novel approach that integrates constrained optimization with diffusion models for MAPF in continuous spaces.
  arXiv  Detail & Related papers  (2024-12-23T21:27:19Z)
• Diffusion Models as Network Optimizers: Explorations and Analysis [71.69869025878856]
  generative diffusion models (GDMs) have emerged as a promising new approach to network optimization. In this study, we first explore the intrinsic characteristics of generative models. We provide a concise theoretical and intuitive demonstration of the advantages of generative models over discriminative network optimization.
  arXiv  Detail & Related papers  (2024-11-01T09:05:47Z)
• Learning Optimal Control and Dynamical Structure of Global Trajectory Search Problems with Diffusion Models [0.5399800035598186]
  This paper explores two global search problems in the circular restricted three-body problem. We build on our prior generative machine learning framework to apply diffusion models to learn the conditional probability distribution.
  arXiv  Detail & Related papers  (2024-10-03T20:35:23Z)
• DiffSG: A Generative Solver for Network Optimization with Diffusion Model [75.27274046562806]
  Diffusion generative models can consider a broader range of solutions and exhibit stronger generalization by learning parameters. We propose a new framework, which leverages intrinsic distribution learning of diffusion generative models to learn high-quality solutions.
  arXiv  Detail & Related papers  (2024-08-13T07:56:21Z)
• DiffuSolve: Diffusion-based Solver for Non-convex Trajectory Optimization [9.28162057044835]
  Optimal trajectory local is computationally expensive for nonlinear and high-dimensional dynamical systems. In this paper we introduce Diffu-based general model for non-dimensional optima problems. We also present Diff+, a novel constrained diffusion model with an additional loss in that further reduces the problem violations.
  arXiv  Detail & Related papers  (2024-02-22T03:52:17Z)
• Amortized Global Search for Efficient Preliminary Trajectory Design with Deep Generative Models [1.1602089225841632]
  Preliminary trajectory design is a global problem that seeks multiple qualitatively different solutions to a trajectory optimization problem. In this paper, we exploit the structure in the solutions to propose an solutions amortized global search (AGS) framework. Our method is evaluated using Derust's 5th function and a low-th circular restricted three-body problem.
  arXiv  Detail & Related papers  (2023-08-07T23:52:03Z)
• Complexity Matters: Rethinking the Latent Space for Generative Modeling [65.64763873078114]
  In generative modeling, numerous successful approaches leverage a low-dimensional latent space, e.g., Stable Diffusion. In this study, we aim to shed light on this under-explored topic by rethinking the latent space from the perspective of model complexity.
  arXiv  Detail & Related papers  (2023-07-17T07:12:29Z)
• Accelerating Inverse Learning via Intelligent Localization with Exploratory Sampling [1.5976506570992293]
  solving inverse problems is a longstanding challenge in materials and drug discovery. Deep generative models are recently proposed to solve inverse problems. We propose a novel approach (called iPage) to accelerate the inverse learning process.
  arXiv  Detail & Related papers  (2022-12-02T08:00:04Z)
• Super-resolution GANs of randomly-seeded fields [68.8204255655161]
  We propose a novel super-resolution generative adversarial network (GAN) framework to estimate field quantities from random sparse sensors. The algorithm exploits random sampling to provide incomplete views of the high-resolution underlying distributions. The proposed technique is tested on synthetic databases of fluid flow simulations, ocean surface temperature distributions measurements, and particle image velocimetry data.
  arXiv  Detail & Related papers  (2022-02-23T18:57:53Z)
• Dynamic Federated Learning [57.14673504239551]
  Federated learning has emerged as an umbrella term for centralized coordination strategies in multi-agent environments. We consider a federated learning model where at every iteration, a random subset of available agents perform local updates based on their data. Under a non-stationary random walk model on the true minimizer for the aggregate optimization problem, we establish that the performance of the architecture is determined by three factors, namely, the data variability at each agent, the model variability across all agents, and a tracking term that is inversely proportional to the learning rate of the algorithm.
  arXiv  Detail & Related papers  (2020-02-20T15:00:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.