确定树求强规划解  

Strong planning solution via determined tree

作　　者：胡雨隆[1] 文中华[1,2] 常青[1] 陈建林[2] 

机构地区：[1]湘潭大学智能制造湖南省高等学校重点实验室,湖南湘潭411105 [2]湘潭大学信息工程学院,湖南湘潭411105

出　　处：《计算机工程与应用》2012年第4期40-42,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60773047);湖南省自然科学基金(No.09JJ6090);湖南省重点学科建设项目(No.081202);湖南省教育厅科研项目(No.08C874);智能制造湖南省高等学校重点实验室(湘潭大学)开放课题(No.2009IM07)

摘　　要：定义了确定树,设计了求确定树的方法。基于该方法设计了求强规划解的算法,找到每个初始状态对应的确定树,在找到确定树之后,求强规划解不需要从目标状态一直搜索到初始状态,只需要从目标状态反向找到确定树的任意一个节点,再通过这个节点在确定树中反向搜索到初始状态从而得到一个强规划解。实验结果表明:所设计的算法比用反向搜索方法求强规划解的算法的效率高。This paper defines the determined tree and designs a method to seek determined tree. This paper designs algorithm for strong planning based on the method. This algorithm finds the initial state corresponding to the determination of each tree. After finding the tree, strong planning solution has no need to search from the goal state to the initial state, and only needs to determine from the target state reverse to find any node of tree. Through the node reverse searching the initial state in the tree, a strong planning solution is got. The results show that the designed algorithm has higher efficiency than the reverse search method solution for strong planning algorithm.

关 键 词：确定树 不确定规划 强规划解 反向搜索 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]