Abstract:

In this paper, a heuristic mission planning method is proposed to deal with the problems of high complexity, real-time response capability and low computational efficiency in the traditional mission planning algorithms for deep space explorer. Firstly, a new constraint simplification algorithm is proposed by use of a heuristic factor derived from the real-time state relationship between the two-two subsystems in the timeline planning model. By using the value of the factor, the temporary subordinate relationships of subsystems are established during the planning period, which can significantly reduce the complexity of constraints in the planning process. Secondly, the timeline state expansion strategy is adopted in the planning algorithm. These expansions are conducted in single timeline and between timelines according to the temporary subordinate relationship, thus obtaining the mission sequence quickly．The simulation results verify the effectiveness of the proposed method, and improve the efficiency and flexibility of the mission planning．

Key words: Mission planning, Constraint simplification, Timeline, Heuristic, Deep space exploration