宇航学报

宇航学报 ›› 2021, Vol. 42 ›› Issue (7): 862-872.doi: 10.3873/j.issn.1000-1328.2021.07.006

• 制导、导航、控制与电子 • 上一篇    下一篇

适用于深空探测器的时间线转移路标启发式规划方法

金颢，徐瑞，朱圣英，李朝玉，梁子璇   

  1. 1. 北京理工大学深空探测技术研究所，北京 100081；2. 深空自主导航与控制工业和信息化部重点实验室，北京 100081
  • 收稿日期:2020-05-13 修回日期:2020-10-27 出版日期:2021-07-15 发布日期:2021-07-15
  • 基金资助:
    国家自然科学基金（61976020）；国家重点研发计划（2019YFA0706501）；基础科研（JCKY2018602B002）；民用航天(MYHT201705)；航天科学技术基金

Heuristic Planning Method Based on Timeline Transition  Landmarks for Deep Space Probes

JIN Hao, XU Rui, ZHU Sheng ying, LI Zhao yu, LIANG Zi xuan   

  1. 1. Institute of Deep Space Exploration, Beijing Institute of Technology, Beijing 100081, China;2. Key Laboratory of Autonomous Navigation and Control for Deep Space Exploration, Ministry of Industry and Information Technology, Beijing 100081, China
  • Received:2020-05-13 Revised:2020-10-27 Online:2021-07-15 Published:2021-07-15

PDF

187

摘要： 针对深空探测器各子系统状态并行及约束耦合的特点，设计了最大转移代价计算方法，并在此基础上提出了时间线路标提取方法。然后，针对路标集合重复计算耗时长的问题，提出了路标增量式搜索算法实现路标集合动态快速更新，并进一步结合最大目标节点筛选策略提出了时间线转移路标启发式规划方法。仿真结果表明，时间线转移路标启发式规划方法能够有效减少冗余规划步数，提高规划求解效率。

关键词: 深空探测器, 任务规划, 时间线路标提取, 转移路标启发式

Abstract: In view of the parallel states and coupling operation constraints of the probes, a landmarks extraction algorithm is proposed based on a timeline based h max heuristic method. Then, in order to reduce the time of repeatedly calculating the landmarks, an incremental search algorithm is designed for dynamically updating landmarks. In addition, a node selection strategy based on the max goal is used for simplicity, and a heuristic planning algorithm with timeline transition landmarks is finally proposed combining all the above methods. The simulation results indicate that the algorithm can prune irrelevant and unnecessary plan steps, and improve the planning efficiency.


Key words: Deep space probes, Mission planning, Timeline landmarks extraction, Transition landmarks heuristics

中图分类号: