首页> 外文会议>International Joint Conference on Artificial Intelligence >Interplanetary Trajectory Planning with Monte Carlo Tree Search
【24h】

Interplanetary Trajectory Planning with Monte Carlo Tree Search

机译:与蒙特卡罗树搜索的行星轨迹规划

获取原文

摘要

Planning an interplanetary trajectory is a very complex task, traditionally accomplished by domain experts using computer-aided design tools. Recent advances in trajectory optimization allow automation of part of the trajectory design but have yet to provide an efficient way to select promising planetary encounter sequences. In this work, we present a heuristic-free approach to automated trajectory planning (including the encounter sequence planning) based on Monte Carlo Tree Search (MCTS). We discuss a number of modifications to traditional MCTS unique to the domain of interplanetary trajectory planning and provide results on the Rosetta and Cassini-Huygens interplanetary mission design problems. The resulting heuristic-free method is found to be orders of magnitude more efficient with respect to a standard tree search with heuristic-based pruning which is the current state-of-the art in this domain.
机译:规划行星际轨迹是一个非常复杂的任务,传统上由域专家使用计算机辅助设计工具完成。轨迹优化的最新进展允许部分轨迹设计的自动化,但尚未提供一种选择有前途的行星遇到序列的有效方法。在这项工作中,我们提出了一种自动化的方法来基于Monte Carlo树搜索(MCT)的自动化轨迹规划(包括遇到序列计划)。我们讨论了对截止行星际轨迹规划领域独一无二的传统MCT的修改,并为罗萨丁和卡西尼 - 惠更斯行星际设计问题提供了结果。发现由此产生的启发式方法是在具有基于启发式的修剪的标准树搜索的标准树搜索中更有效率,这是该域中的当前最先进的序列。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号