Journal of Astronautics ›› 2021, Vol. 42 ›› Issue (7): 862-872.doi: 10.3873/j.issn.1000-1328.2021.07.006

Previous Articles     Next Articles

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

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

CLC Number: