Time Stamped States based Heuristic Algorithm for Spacecraft Mission Planning

Abstract

For real time in deep space exploration, it is a requirement of autonomous mission planning for the explorer to find a plan as soon as possible. A kind of method is to use heuristic algorithm. At the same time, durative actions and numeric information have to be processed. According to these characteristics, this paper adapts planning domain definition language (PDDL) to establish knowledge models and describe time and resource constraints. Then the heuristic algorithm based on condition number is proposed to solve planning problems of deep space exploration. Finally, we compare this heuristic with context-enhanced additive heuristic based on action time in TFD (Temporal Fast Downward) planner. The result of the experiment shows that the heuristic algorithm we proposed is better to solve the planning problems in deep space from the point of view of real time.

Keywords

deep space exploration / heuristic / durative actions / numeric