Global Search of Optimal Spacecraft Trajectories using Amortization and Deep Generative Models

• URL: http://arxiv.org/abs/2412.20023v1
• Date: Sat, 28 Dec 2024 04:57:12 GMT
• Title: Global Search of Optimal Spacecraft Trajectories using Amortization and Deep Generative Models
• Authors: Ryne Beeson, Anjian Li, Amlan Sinha,
• Abstract summary: 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.
• Score: 0.5898893619901381
• License:
• Abstract: Preliminary spacecraft trajectory optimization is a parameter dependent global search problem that aims to provide a set of solutions that are of high quality and diverse. In the case of numerical solution, it is dependent on the original optimal control problem, the choice of a control transcription, and the behavior of a gradient based numerical solver. In this paper 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 conditional distribution is learned and represented using deep generative models that allow for prediction of how the local basins change as parameters vary. The approach is benchmarked on a low thrust spacecraft trajectory optimization problem in the circular restricted three-body problem, showing significant speed-up over a simple multi-start method and vanilla machine learning approaches. The paper also provides an in-depth analysis of the multi-modal funnel structure of a low-thrust spacecraft trajectory optimization problem.

Related papers

• Global Search for Optimal Low Thrust Spacecraft Trajectories using Diffusion Models and the Indirect Method [0.0]
  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.
  arXiv  Detail & Related papers  (2025-01-13T01:49:17Z)
• GlobalPointer: Large-Scale Plane Adjustment with Bi-Convex Relaxation [44.98626468432535]
  Plane adjustment is crucial for many 3D applications, involving simultaneous pose estimation and plane recovery. We exploit a novel optimization strategy termed textitBi-Convex Relaxation, which decouples the original problem into two simpler sub-problems. We propose two algorithmic variants for solving the plane adjustment problem, namely textitGlobalPointer and textitGlobalPointer++.
  arXiv  Detail & Related papers  (2024-07-18T14:09:03Z)
• 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)
• Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [52.0617030129699]
  We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods. Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem. As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
  arXiv  Detail & Related papers  (2023-10-08T23:39:38Z)
• 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)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• 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)
• Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
  We present an end-to-end method to learn the proximal operator across non-family problems. We show that for weakly-ized objectives and under mild conditions, the method converges globally.
  arXiv  Detail & Related papers  (2022-01-28T05:53:28Z)
• An end-to-end data-driven optimisation framework for constrained trajectories [4.73357470713202]
  We leverage data-driven approaches to design a new end-to-end framework for optimisation problems. We apply our approach to two settings in aeronautics and sailing routes, yielding commanding results.
  arXiv  Detail & Related papers  (2020-11-24T00:54:17Z)
• Localized active learning of Gaussian process state space models [63.97366815968177]
  A globally accurate model is not required to achieve good performance in many common control applications. We propose an active learning strategy for Gaussian process state space models that aims to obtain an accurate model on a bounded subset of the state-action space. By employing model predictive control, the proposed technique integrates information collected during exploration and adaptively improves its exploration strategy.
  arXiv  Detail & Related papers  (2020-05-04T05:35:02Z)
• Implicit differentiation of Lasso-type models for hyperparameter optimization [82.73138686390514]
  We introduce an efficient implicit differentiation algorithm, without matrix inversion, tailored for Lasso-type problems. Our approach scales to high-dimensional data by leveraging the sparsity of the solutions.
  arXiv  Detail & Related papers  (2020-02-20T18:43:42Z)

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.