THE ALGORITHM OF SEARCHING FOR VALID PLAN THROUGH GOAL DECOMPOSITION

摘要：

First, there are several new concepts proposed, such as valid sub plan, independent graph, maximal independent set,importance coefficient and so on. Then the algorithm of finding the maximal independent sets is described. In section 4,Given the preconditions of entering the stage of searching for valid plan which are different from all the same kind of researches, not only the planning graph of which all the goal propositions turn out can be searched for valid plan, but also the planning graph of which only a part of goal propositions turn out can be searched when the planning graph levels off.Based on these, in order to make planning graph, which can not be searched for valid plan, can be searched for a part of sub plans, the algorithm of searching for valid plan through goal decomposition is proposed. According to the important extent of these goals, which can be achieved, select a sub plan to execute to make these goals achieve. So the problem-solving capability of the planner will be improved.

关键词： Valid plan Valid sub plan Independent graph Maximal independent set Importance coefficient

作者: JIN-YAN WANG SHU-HUA LIU

作者单位: Department of Computer Science, School of Computer, Northeast Normal University, Changchun 130117, China

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 819-825

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）