arXiv:2410.20839astro-ph.EPastro-ph.IM2024-10被引 14

用机器学习与新算法解决小行星采矿的高效路径规划问题

Asteroid Mining: ACT&Friends' Results for the GTOC 12 Problem

  • 结合机器学习与天体力学优化,精准衔接低推力轨道与脉冲转移模型
  • 将最优采矿路径选择转化为整数线性规划,提升搜索效率
  • 设计前瞻评分机制,有效识别可重复访问的小行星,适合航天任务规划者

2023年,第12届全球轨迹竞赛围绕“可持续小行星采矿”展开。本文报告了欧洲航天局先进概念团队提出的解决方案。尽管最终未进入前四名,但研究中发展出多项创新方法具有广泛适用性。特别是,基于机器学习和天体力学原理的新方法,能高精度填补完整低推力轨道与其脉冲兰伯特转移表示之间的差距。提出一种新方法,将从预存最优采矿轨迹库中选取最优子集的问题建模为整数线性规划。此外,针对单条最优采矿路径(采集全部资源)的求解问题,虽忽略船间协作导致次优,但仍通过基于前瞻评分的新型搜索策略高效求解,确保所选小行星具备后续重访潜力。

原文摘要 · Abstract (English)

In 2023, the 12th edition of Global Trajectory Competition was organised around the problem referred to as "Sustainable Asteroid Mining". This paper reports the developments that led to the solution proposed by ESA's Advanced Concepts Team. Beyond the fact that the proposed approach failed to rank higher than fourth in the final competition leader-board, several innovative fundamental methodologies were developed which have a broader application. In particular, new methods based on machine learning as well as on manipulating the fundamental laws of astrodynamics were developed and able to fill with remarkable accuracy the gap between full low-thrust trajectories and their representation as impulsive Lambert transfers. A novel technique was devised to formulate the challenge of optimal subset selection from a repository of pre-existing optimal mining trajectories as an integer linear programming problem. Finally, the fundamental problem of searching for single optimal mining trajectories (mining and collecting all resources), albeit ignoring the possibility of having intra-ship collaboration and thus sub-optimal in the case of the GTOC12 problem, was efficiently solved by means of a novel search based on a look-ahead score and thus making sure to select asteroids that had chances to be re-visited later on.

航天任务路径规划机器学习小行星采矿

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。