A general heuristic bottom-up procedure for searching and/or graphs

https://doi.org/10.1016/0020-0255(91)90023-NGet rights and content

Abstract

This paper presents a general heuristic bottom-up procedure for finding a least-cost solution tree of an AND/OR graph when the cost functions associated with the arcs are monotone. Since monotone cost functions are very general, the procedure is applicable to a very large number of problems. The procedure works for both cyclic and acyclic AND/OR graphs, and subsumes most of the known bottom-up procedures for searching AND/OR graphs. Many state-space search procedures and dynamic programming procedures are also special cases of this procedure.

References (25)

  • S. Gnesi et al.

    Dynamic programming as graph searching

    JACM

    (1982)
  • P.A.V. Hall

    Branch-and-bound and beyond

  • Cited by (4)

    This work was supported in part by Army Research Office grant #DAAG29-84-K-0060 to the Artificial Intelligence Laboratory at the University of Texas at Austin, when the author was on the faculty at the University of Texas.

    View full text