Exploiting CSP Techniques in Temporal Graphplan

Exploiting CSP search techniques such as forward checking, arc consistency, dynamic variable ordering, conflict-directed back jumping and local search strategies in the classical Graphplan can effectively avoid the conflicts and the low effect in the process of solution extraction. In this paper, we pay attention to a more complex planning problem - temporal planning problem under the Graphplan framework. We adopt CSP search techniques in the temporal planning graph, which make the process of solution extraction more efficient. So our research is very helpful to the development of robotology, natural language understanding, intelligent agent etc