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