Heuristic mission planning approach for deep space explorer

Considering the numeric constraints, a planning approach based on a domain independent heuristic approach is proposed, and the heuristic is abstracted from the planning activity relevancy. The relevancy between activities is defined, and a dynamic self-learning updating process is given. The heuristic is designed based on the relevancy, guiding the activity selecting in the planning process, and the heuristic planning algorithm is finally proposed. The simulation results show that the algorithm can efficiently reduce planning steps and backtracking steps and improve the planning efficiency for deep space explorer.