Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

An AND-OR Graph Search Algorithm Under the Admissibility Condition Relaxed

  • Lee, Chae-Y.
  • Published : 1989.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

An algorithm that searches the general AND-OR graph is proposed. The convergence and the efficiency of the algorithm is examined and compared with an existing algorithm for the AND-OR graph. It is proved that the proposed algorithm is superior to the existing method both in the quality of the solution and the number of node expansions.

Keywords

References

  1. Journal of the Association for Computing Machinery v.30 Search Algorithms under Different kinds of Heuristics-A Comparitive Study Bagchi,A.;A.Mahanti
  2. Artificial Intelligence v.2 An admissible and Optimal Algorithm for Searching AND-OR Graphs Chang,C.L.;J.R.Slagle
  3. Artificial Intelligence v.8 On the Complexity of Admissible Search Algorithms Martelli,A.
  4. Artifical Intelligence v.23 General Branch and Bound, and its Relation to $A^*$ and $AO^*$ Nau,D.S.;V.Kumar;L.Kanal
  5. Principles of Artificial Intelligence Nilsson,N.J.