• DOI:10.1145/3828.3830
Corpus ID: 2092415

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

View on ACM

ics.uci.edu

Save to Library

Create Alert

Cite

Launch Research Feed