A weighted technique in heuristic search

  • Authors:

  • Bo Zhang;Ling Zhang

  • Affiliations:

  • Dept. of Computer Science, Tsinghua University, Beijing, China;Dept. of Mathematics, Anqing Teachers' College, Anqing, Anhui, China

  • Venue:
  • IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

As shown in [1], we examine search as a statistic sampling process. Based on some statistical inference method the probability that a subtree in search tree contains the goal can be decided. Thus some weight is in tentionaly added to the evaluation function of those nodes which are unlikely in the solution path so that the search will concentrate on the most promising path. It results in a new weighted algorithm-WSA. Tn a uniform m-ary tree, we show that a goal can be found by WSA in the polynomial time, although the computational complexity of A (or A*) may be O(e) for searching the same space. Where N is the depth at which the goal is located.