Amortized Global Search for Efficient Preliminary Trajectory Design with Deep Generative Models

Anjian Li, Amlan Sinha, Ryne Beeson
8/7/2023
cs.LGmath.OC

No confident code implementation found for this paper.

Abstract

Preliminary trajectory design is a global search problem that seeks multiple qualitatively different solutions to a trajectory optimization problem. Due to its high dimensionality and non-convexity, and the frequent adjustment of problem parameters, the global search becomes computationally demanding. In this paper, we exploit the clustering structure in the solutions and propose an amortized global search (AmorGS) framework. We use deep generative models to predict trajectory solutions that share similar structures with previously solved problems, which accelerates the global search for unseen parameter values. Our method is evaluated using De Jong's 5th function and a low-thrust circular restricted three-body problem.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2023amortized,
  title  = {Amortized Global Search for Efficient Preliminary Trajectory Design with Deep Generative Models},
  author = {Anjian Li and Amlan Sinha and Ryne Beeson},
  year   = {2023},
  eprint = {2308.03960},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.03960v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.03960.svg)](https://codeofpaper.com/paper/2308.03960)

Discussion