论文标题

Theantipodes团队:GTOC11的解决方案方法

Team theAntipodes: Solution Methodology for GTOC11

论文作者

Armellin, Roberto, Beauregard, Laurent, Bellome, Andrea, Bernardini, Nicolò, Fossa, Alberto, Fu, Xiaoyu, Holt, Harry, Parigini, Cristina, Pirovano, Laura, Wijayatunga, Minduli

论文摘要

本文介绍了团队“ Theantipodes”为第11届全球轨迹优化竞争(GTOC11)开发的解决方案方法。该方法由四个主要区块组成:1)母链链的产生,2)会合餐桌生成,3)调度员和4)改进。块1和3是纯粹的组合优化问题,选择小行星访问并将其分配到戴森环站。集合表的产生涉及插值时间彻底的转移,以找到选定的小行星和环站之间的所有转移机会。调度员使用存储在表中的数据,并最佳地将小行星分配给戴森环站。改进确保每个会合轨迹都符合问题的准确性限制,并将深空操作引入母亲转移。我们提供了解决方案的细节,即得分为5,992,值得排名第三。

This paper presents the solution approach developed by the team "theAntipodes" for the 11th Global Trajectory Optimization Competition (GTOC11). The approach consists of four main blocks: 1) mothership chain generation, 2) rendezvous table generation, 3) the dispatcher, and 4) the refinement. Blocks 1 and 3 are purely combinatorial optimization problems that select the asteroids to visit and allocate them to the Dyson ring stations. The rendezvous table generation involves interpolating time-optimal transfers to find all transfer opportunities between selected asteroids and the ring stations. The dispatcher uses the data stored in the table and allocates the asteroids to the Dyson ring stations optimally. The refinement ensures each rendezvous trajectory meets the problem accuracy constraints and introduces deep-space maneuvers to the mothership transfers. We provide the details of our solution that, with a score of 5,992, was worth 3rd place.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源