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

  • 제14권1호
  • /
  • Pages.27-35
  • /
  • 1989
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

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

  • Lee, Chae-Y.
  • 발행 : 1989.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  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.