正向搜索方法求强规划解

计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (6): 52-54.

正向搜索方法求强规划解

陈建林，文中华，朱江，常青

湘潭大学信息工程学院，湖南湘潭 411105

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-02-21 发布日期:2011-02-21

Strong planning solution via forward search

CHEN Jianlin，WEN Zhonghua，ZHU Jiang，CHANG Qing

College of Information Engineering，Xiangtan University，Xiangtan，Hunan 411105，China

Received:1900-01-01 Revised:1900-01-01 Online:2011-02-21 Published:2011-02-21

摘要/Abstract

摘要： 以规划领域中的不确定状态转移系统作为研究对象，设计了求强规划解问题中的状态分层方法，状态被分层以后，求强规划解只需要从初始状态出发，逐次向下层状态转移到目标状态就可以了，在此基础上，设计了用正向搜索方法求强规划解的算法。实验结果表明：所设计的算法比用反向搜索方法求强规划解算法的效率高。

关键词: 正向搜索, 不确定规划, 状态动作序偶, 强规划解

Abstract: This paper studies strong planning solution under uncertainty.A way which obtains hierarchical states for searching strong planning solution is designed.An algorithm in strong planning solution based on forward search method in the field of nondeterministic state-transition system is given.The experimental results show that the algorithm based on forward search method is superior to the algorithm based on backward search method.

Key words: forward search, planning under uncertainty, state-action pair, strong planning solution

陈建林，文中华，朱江，常青. 正向搜索方法求强规划解[J]. 计算机工程与应用, 2011, 47(6): 52-54.

CHEN Jianlin，WEN Zhonghua，ZHU Jiang，CHANG Qing. Strong planning solution via forward search[J]. Computer Engineering and Applications, 2011, 47(6): 52-54.

[1]	王进宗，文中华，唐杰，龙凤. 不确定规划领域中带权值的观察信息约简[J]. 计算机工程与应用, 2016, 52(3): 55-58.
[2]	胡雨隆1，文中华1，2，常青1，陈建林1. 确定树求强规划解[J]. 计算机工程与应用, 2012, 48(4): 40-42.
[3]	柴啸龙，胡桂武，陈蔼祥. Markov决策过程的蚁群规划算法[J]. 计算机工程与应用, 2010, 46(20): 40-41.
[4]	胡平常晓宇王康平郭东伟周春光. 求解不确定TSP问题的蚂蚁算法[J]. 计算机工程与应用, 2007, 43(3期): 30-30.