An AND-OR Graph Search Algorithm Under the Admissibility Condition Relaxed
Chae Y. Lee · 1989
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.