Planning system based on heuristic

Nowadays the research for planning has centered around two themes - one is based on planning-graph, exemplified by Graphplan, another is the research on heuristic state space search, exemplified by UNPOP, HSP and HSP-r. Every approach has its advantages and disadvantages. This paper proposes a new concept and introduces a novel method for successfully using the actions mutual exclusion in heuristic state space search, defining a new heuristic function to guide plan, and applying the new heuristic to advance a new planning system to deal with planning problems. This planning system leverages complementary strengths of Graphplan and heuristic state search planning. It can solve many planning problems, which can´t be solved by the heuristic state space search planning system using sum mutex heuristic, and the performance of the new system is prominent. The quality of planning solution, which is produced by this planner, is excellent.