TY - JOUR
T1 - Sustainable Asteroid Mining
T2 - Results and methods of team BIT-CAS-DFH for GTOC12
AU - Pang, Bo
AU - Sun, Yangyuxi
AU - Zhang, Guoxu
AU - Zhang, Yining
AU - Zhu, Tianhao
AU - Wang, Yangxin
AU - Jin, Zihan
AU - Li, Zhaohang
AU - He, Lvzheng
AU - Lu, Meng
AU - Zhou, Rui
AU - Yin, Yongchen
AU - Shang, Yunong
AU - He, Shengmao
AU - Peng, Chao
AU - Zhu, Zhengfan
AU - Zhang, Yang
AU - Gao, Yang
AU - Wen, Changxuan
N1 - Publisher Copyright:
© Tsinghua University Press 2025.
PY - 2025/2
Y1 - 2025/2
N2 - The 12th Global Trajectory Optimization Competition challenged teams to design trajectories for mining asteroids and transporting extracted resources back to the Earth. This paper outlines the methods and results of the runner-up team, BIT-CAS-DFH, highlighting an overall analysis of the approach as well as detailed descriptions of the methods used. The approach begins with building databases to reduce computational costs in trajectory design. Then, asteroid sequences are determined. A segmentation-based approach was adopted to efficiently handle the large dataset. Each sequence was divided into four time-based segments. Segments 1 and 4 were generated forward and backward, respectively, using a breadth-first beam search. Candidates for these segments were refined using genetic and greedy algorithms. Segments 2 and 3 were then generated and selected forward and backward based on the results of Segments 1 and 4. Following this, a matching process paired candidates from Segments 2 and 3. With the asteroid sequences established, low-thrust trajectories were optimized using indirect methods. A local optimization strategy was employed to maximize the collected mass by fine-tuning rendezvous timings. The final solution is presented, with comparative analyses against other teams’ approaches. (Figure presented.)
AB - The 12th Global Trajectory Optimization Competition challenged teams to design trajectories for mining asteroids and transporting extracted resources back to the Earth. This paper outlines the methods and results of the runner-up team, BIT-CAS-DFH, highlighting an overall analysis of the approach as well as detailed descriptions of the methods used. The approach begins with building databases to reduce computational costs in trajectory design. Then, asteroid sequences are determined. A segmentation-based approach was adopted to efficiently handle the large dataset. Each sequence was divided into four time-based segments. Segments 1 and 4 were generated forward and backward, respectively, using a breadth-first beam search. Candidates for these segments were refined using genetic and greedy algorithms. Segments 2 and 3 were then generated and selected forward and backward based on the results of Segments 1 and 4. Following this, a matching process paired candidates from Segments 2 and 3. With the asteroid sequences established, low-thrust trajectories were optimized using indirect methods. A local optimization strategy was employed to maximize the collected mass by fine-tuning rendezvous timings. The final solution is presented, with comparative analyses against other teams’ approaches. (Figure presented.)
KW - Global Trajectory Optimization Competition
KW - low-thrust trajectory optimization
KW - multiple asteroid rendezvous
KW - sustainable asteroid mining
UR - http://www.scopus.com/pages/publications/86000049459
U2 - 10.1007/s42064-024-0241-5
DO - 10.1007/s42064-024-0241-5
M3 - Article
AN - SCOPUS:86000049459
SN - 2522-0098
VL - 9
SP - 107
EP - 128
JO - Astrodynamics
JF - Astrodynamics
IS - 1
ER -