Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8132211 | Advances in Space Research | 2018 | 30 Pages |
Abstract
This paper proposes a two-phase framework to obtain a near-optimal solution of multi-target Lambert rendezvous problem. The objective of the problem is to determine the minimum-cost rendezvous sequence and trajectories to visit a given set of targets within a maximum mission duration. The first phase solves a series of single-target rendezvous problems for all departure-arrival object pairs to generate the elementary solutions, which provides candidate rendezvous trajectories. The second phase formulates a variant of traveling salesman problem (TSP) using the elementary solutions prepared in the first phase and determines the final rendezvous sequence and trajectories of the multi-target rendezvous problem. The validity of the proposed optimization framework is demonstrated through an asteroid exploration case study.
Related Topics
Physical Sciences and Engineering
Earth and Planetary Sciences
Space and Planetary Science
Authors
Jun Bang, Jaemyung Ahn,