• 人工智能及识别技术 •

### 一种快速求强规划解的算法

1. (1. 湘潭大学信息工程学院,湖南湘潭411105; 2. 湖南工程学院计算机与通信学院,湖南湘潭411104)
• 收稿日期:2014-03-07 出版日期:2015-03-15 发布日期:2015-03-13
• 作者简介:劳佳琪(1990 - ),男,硕士研究生,主研方向:智能规划;文中华,教授、博士生导师;伍小辉、唐　杰,硕士研究生。
• 基金资助:
国家自然科学基金资助项目(61070232, 61272295, 61105039, 61202398);湖南省重点学科建设基金资助项目(0812);湖南省 教育厅科学研究基金资助一般项目(12C0399)。

### A Fast Algorithm for Solving Strong Planning Solution

LAO Jiaqi 1,WEN Zhonghua 1,2,WU Xiaohui 1,TANG Jie 1

1. (1. College of Information Engineering,Xiangtan University,Xiangtan 411105,China; 2. College of Computer and Communication,Hunan Institute of Engineering,Xiangtan 411104,China)
• Received:2014-03-07 Online:2015-03-15 Published:2015-03-13

Abstract: This paper designs a quick solution to solve the simplified layered strong planning algorithm to increase the settlement efficiency. It is based on the introduction of greedy strategy,screening for non-target state for each action. This algorithm removes useless action plan for solving the strong solution to accelerate the state down search speed. On the basis of improved stratification, optimization and strong strategic planning solution, because the solution process is repeated,there are a lot of searching,and therefore the algorithm creates a collection to save the state having access to information,to avoid duplication of state search. After analysis,in the condition that the paths which are the intial state to goal state are overlapping,and the time complexity of this algorithm is O(nm),(n is the number of the initial state,m is the number of layers). The time complexity is O(m) in the condition that all the initial states to the target states are coincident. And the results are better than the ordinary forward search algorithm and reverse search algorithm.