In this work, Team ASRL’s solution approach for the 11th Global Trajectory Optimization Competition (GTOC-11) is described. This problem tasked the competing teams with constructing a futuristic Dyson Ring utilizing materials acquired from the asteroid belt. In total, 10 motherships would depart from Earth in the year 2121 and visit as many asteroids as possible. After visiting each asteroid, a low-thrust propulsion module would transfer the material down to the desired final Dyson stations. The final approach utilized a deterministic tree search that involved alternating between fixed time of flight Lambert searches and solutions to the full-fidelity optimal control problem. Once a single tour had been constructed, transfer trajectories were computed for each asteroid to as many of the building stations as possible. After computing a pool of thousands of these completed legs, a bin packing algorithm was used to determine the highest scoring combination of 10 solutions. This search process was implemented in Python using the soon-to-be-released trajectory optimization tool, ASSET. Ultimately, the team finished 5th with a score of 5525.38.

在这项工作中，描述了 ASRL 团队在第 11 届全球轨迹优化竞赛 (GTOC-11) 中的解决方法。这个问题要求参赛团队利用从小行星带获得的材料建造一个未来派的戴森环。总共有 10 艘母舰将在 2121 年离开地球，并尽可能多地访问小行星。在访问每颗小行星后，一个低推力推进模块会将材料向下传送到所需的最终戴森站。最后一种方法使用确定性树搜索，该搜索涉及在固定飞行时间兰伯特搜索和全保真最优控制问题的解决方案之间交替。一旦构建了单次旅行，就会计算每颗小行星到尽可能多的建筑站的转移轨迹。在计算了数千个完成的腿后，使用装箱算法来确定 10 个解决方案的最高得分组合。这个搜索过程是在 Python 中使用即将发布的轨迹优化工具 ASSET 实现的。最终，该队以5525.38的成绩获得第5名。