Research on Task Planning Problems for Deep Space Exploration Based on Constraint Satisfaction

Abstract

The ordinary CSP algorithms cannot reflect the characteristics of the task planning progress. How the action rules in task planning for deep space exploration can be mapped into the constraint satisfaction problems is discussed. Based on the conclusion，an action directed constraint is proposed to guide the variable selection procedure in constraint satisfaction problems. Through theoretical analysis，the proposed technology can be used in constraint-programmed planning problem. The simulation experiments show that the algorithm with action guided constraint can effectively reduce the number of constraint checks during the planning procedure and has a better performance on total running time over the standard version. It lays the foundation for the application of the project.

Keywords

planning / constraint satisfaction / variable selection / action-oriented