Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Spanning tree trajectory optimization in the galaxy space

Spanning tree trajectory optimization in the galaxy space The 10th edition of the Global Trajectory Optimization Competition considered the problem of the galaxy settlement wherein competitors from all over the world were expected to design the trajectories of different settler vessels to maximize the given multi-faceted merit function. The synthesis methods used by the winning team, led jointly by the National University of Defense Technology (NUDT) and Xi’an Satellite Control Center (XSCC), are described along with a greedy search method and the improved solution obtained by University of Jena. Specifically, we presented a layout-first topology-second approach that allows an efficient settlement tree search guided by the pre-specified ideal spatial distribution. We also explained how the problem of constructing settlement trees can be modeled as the widely studied minimum spanning tree problem. Furthermore, University of Jena explored the possibility that a greedy search can generate even better settlement trees, based on the same initial conditions, when compared to that of the winning solution. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Astrodynamics Springer Journals

Spanning tree trajectory optimization in the galaxy space

Loading next page...
 
/lp/springer-journals/spanning-tree-trajectory-optimization-in-the-galaxy-space-TxStwo3z5h
Publisher
Springer Journals
Copyright
Copyright © Tsinghua University Press 2020
ISSN
2522-008X
eISSN
2522-0098
DOI
10.1007/s42064-020-0088-3
Publisher site
See Article on Publisher Site

Abstract

The 10th edition of the Global Trajectory Optimization Competition considered the problem of the galaxy settlement wherein competitors from all over the world were expected to design the trajectories of different settler vessels to maximize the given multi-faceted merit function. The synthesis methods used by the winning team, led jointly by the National University of Defense Technology (NUDT) and Xi’an Satellite Control Center (XSCC), are described along with a greedy search method and the improved solution obtained by University of Jena. Specifically, we presented a layout-first topology-second approach that allows an efficient settlement tree search guided by the pre-specified ideal spatial distribution. We also explained how the problem of constructing settlement trees can be modeled as the widely studied minimum spanning tree problem. Furthermore, University of Jena explored the possibility that a greedy search can generate even better settlement trees, based on the same initial conditions, when compared to that of the winning solution.

Journal

AstrodynamicsSpringer Journals

Published: Nov 13, 2020

There are no references for this article.