| 启发式搜索中一种新的加权技术 |
| |
| 引用本文： | 张钹,张铃. 启发式搜索中一种新的加权技术[J]. 清华大学学报(自然科学版), 1986, 0(3) |
| |
| 作者姓名： | 张钹 张铃 |
| |
| 作者单位： | 清华大学计算机科学与技术系(张钹)，安庆师院数学系(张铃) |
| |
| 摘 要： | 本文提出一种新的加权算法——ＷＳＡ法，它是在Ａ（或Ａ＊）搜索中引入一种新的加权技术。根据［１］中提出的原理，可以把启发式搜索看成某种随机取样过程，所以通过某种统计推断的方法，可以估计出搜索树中各子树包含目标的可能性．然后把某个权值加到不大可能是解路径上节点的估价函数上，从而使搜索集中在最有希望的路径上。在一致ｍ一枝树上；我们证明了这种加权方法可显著提高效率。
|
| 关 键 词： | 加权 启发式搜索 复杂性 |
A New Weighted Technique in Heuristic Search |
| |
| Zhang Bo. A New Weighted Technique in Heuristic Search[J]. Journal of Tsinghua University(Science and Technology), 1986, 0(3) |
| |
| Authors: | Zhang Bo |
| |
| Affiliation: | Zhang Bo Department of Computer Science and Technology,Tsinghua University Zhang Ling Department of Mathematics,Anqing Pedagogical College |
| |
| Abstract: | A new weighted technique is incorparated in A (or A*) search which results in a new algorithm-WSA. It is known from previous work[1] by authors that heuristic search can be considered as a random sampling process. Based on some statistic inference method, the probability that a subtree in search tree contains the goal can thus be estimated. Some weight can be added to the nodes which are unlikely in the solution path so that the search will focus on the most promising path. In a uniform m-ary tree, we show that the new weighted method can improve the search efficiency significantly. |
| |
| Keywords: | weight heuristic search complexity. |
| 本文献已被 CNKI 等数据库收录！ |
