Generalized best-first search strategies and the optimality of A*

@article{Dechter1985GeneralizedBS,
  title={Generalized best-first search strategies and the optimality of A*},
  author={R. Dechter and J. Pearl},
  journal={J. ACM},
  year={1985},
  volume={32},
  pages={505-536}
}
  • R. Dechter, J. Pearl
  • Published 1985
  • Mathematics, Computer Science
  • J. ACM
  • This paper reports several properties of heuristic best-first search strategies whose scoring functions ƒ depend on all the information available from each candidate path, not merely on the current cost g and the estimated completion cost h. It is shown that several known properties of A* retain their form (with the minmax of f playing the role of the optimal cost), which helps establish general tests of admissibility and general conditions for node expansion for these strategies. On the basis… CONTINUE READING
    954 Citations
    The optimality of A
    • 69
    Space-efficient search algorithms
    • 24
    Understanding the Search Behaviour of Greedy Best-First Search
    • 7
    • PDF
    Search behavior of greedy best-first search
    • PDF
    Best-First Search with Maximum Edge Cost Functions
    • 3
    • Highly Influenced
    • PDF
    COMPARISON OF VARIOUS HEURISTIC SEARCH TECHNIQUES FOR FINDING SHORTEST PATH
    • 11
    • PDF
    A heuristic search strategy for optimization of trade-off cost measures
    • R. Singh, S. Kumar, V. Arvind
    • Computer Science
    • [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91
    • 1991
    • 1
    New Search Heuristics for Max-CSP
    • K. Kask
    • Mathematics, Computer Science
    • CP
    • 2000
    • 21
    • PDF