确定树求强规划解

计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (4): 40-42.

确定树求强规划解

胡雨隆1，文中华1，2，常青1，陈建林1

1.湘潭大学信息工程学院，湖南湘潭 411105
2.湘潭大学智能制造湖南省高等学校重点实验室，湖南湘潭 411105

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2012-02-01 发布日期:2012-04-05

Strong planning solution via determined tree

HU Yulong1, WEN Zhonghua1，2, CHANG Qing1, CHEN Jianlin1

1.College of Information Engineering, Xiangtan University, Xiangtan, Hunan 411105, China
2.Key Lab of Intelligent Manufacture of Hunan Province, Xiangtan University, Xiangtan, Hunan 411105, China

Received:1900-01-01 Revised:1900-01-01 Online:2012-02-01 Published:2012-04-05

摘要/Abstract

摘要： 定义了确定树，设计了求确定树的方法。基于该方法设计了求强规划解的算法，找到每个初始状态对应的确定树，在找到确定树之后，求强规划解不需要从目标状态一直搜索到初始状态，只需要从目标状态反向找到确定树的任意一个节点，再通过这个节点在确定树中反向搜索到初始状态从而得到一个强规划解。实验结果表明：所设计的算法比用反向搜索方法求强规划解的算法的效率高。

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

Abstract: 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.

Key words: determined tree, non-determinate plan, strong planning solution, reverse search

胡雨隆1，文中华1，2，常青1，陈建林1. 确定树求强规划解[J]. 计算机工程与应用, 2012, 48(4): 40-42.

HU Yulong1, WEN Zhonghua1，2, CHANG Qing1, CHEN Jianlin1. Strong planning solution via determined tree[J]. Computer Engineering and Applications, 2012, 48(4): 40-42.

[1]	王梦璐，李连忠. 动态反向搜索更新位置的改进灰狼优化算法[J]. 计算机工程与应用, 2021, 57(18): 86-96.
[2]	王进宗，文中华，唐杰，龙凤. 不确定规划领域中带权值的观察信息约简[J]. 计算机工程与应用, 2016, 52(3): 55-58.
[3]	刘卫明1，2，蒯海龙1，陈志刚3，毛伊敏1，4. 基于有序树的不确定数据最大频繁项挖掘算法[J]. 计算机工程与应用, 2015, 51(24): 145-149.
[4]	陈建林，文中华，朱江，常青. 正向搜索方法求强规划解[J]. 计算机工程与应用, 2011, 47(6): 52-54.
[5]	颜一鸣1，2，郭鑫2，李仁发1. 一种非确定树模式挖掘算法[J]. 计算机工程与应用, 2011, 47(15): 160-164.
[6]	柴啸龙，胡桂武，陈蔼祥. Markov决策过程的蚁群规划算法[J]. 计算机工程与应用, 2010, 46(20): 40-41.
[7]	胡平常晓宇王康平郭东伟周春光. 求解不确定TSP问题的蚂蚁算法[J]. 计算机工程与应用, 2007, 43(3期): 30-30.