关键词: 智能规划, 规划图, 缩规划图, 启发式信息, 领域信息

Abstract: The traditional technique of graph planning has a bottle-neck of efficiency when the algorithm dealing with the large scale problem.The reason is that almost all intelligence planning problems are NP hard，and the calculating quantity is a blow to the algorithm by degrees.Some improvements of the graph planning techniques are made in this paper as follows.First，the domain information mining is used in the algorithm.Second，the shrink planning graph also with the corresponding algorithm are presented based on the heuristic function from domain information.The algorithm can rank the different expanding branch，and prune some expanding branch with little hope.A related experiment of planning shows that the tactic is work.

Key words: intelligence planning, planning graph, shrink planning graph, heuristic information, domain knowledge