A Weighted Technique in Heuristic Search

Zhang, Bo; Zhang, Ling

A Weighted Technique in Heuristic Search

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Planning and Search. Pages 1037-1038.

Abstract

As shown in (1), we examine search as a statistic sampling proce s s. Based on some statistical infe rence method the probability that a subtree in search tree conteins the goal can be decided . Th us some weight is intentionaly 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 p a th. It results in a new weig hte d a lgorithm-WSA. In a uniform m- ary tree, we show that a goal can be found by WSA in the polynomial time, although tßN computational complexity of A (or A*) may be O(e ) for searching the same space. Where N is the depth at which the goa l i s loc ated.

Bo Zhang, and Ling Zhang. 1985. A Weighted Technique in Heuristic Search. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 1037–1038. https://ijcai.org/proceedings/1985/209

@inproceedings{ijcai1985p209,
  title     = {A Weighted Technique in Heuristic Search},
  author    = {Zhang, Bo and Zhang, Ling},
  booktitle = {Proceedings of the Ninth International Joint Conference on
               Artificial Intelligence, {IJCAI-85}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Aravind Joshi},
  pages     = {1037--1038},
  year      = {1985},
  note      = {Planning and Search},
  url       = {https://ijcai.org/proceedings/1985/209},
}

TY  - CPAPER
TI  - A Weighted Technique in Heuristic Search
AU  - Zhang, Bo
AU  - Zhang, Ling
T2  - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1985
SP  - 1037
EP  - 1038
UR  - https://ijcai.org/proceedings/1985/209
ER  -