Machine discovery of effective admissible heuristics

@article{Prieditis1991MachineDO,
  title={Machine discovery of effective admissible heuristics},
  author={Armand Prieditis},
  journal={Machine Learning},
  year={1991},
  volume={12},
  pages={117-141}
}
Admissible heuristics are an important class of heuristics worth discovering: they guarantee shortest path solutions in search algorithms such asA* and they guarantee less expensively produced, but boundedly longer solutions in search algorithms such as dynamic weighting. Unfortunately, effective (accurate and cheap to compute) admissible heuristics can take years for people to discover. Several researchers have suggested that certain transformations of a problem can be used to generate… CONTINUE READING
Highly Cited
This paper has 95 citations. REVIEW CITATIONS

5 Figures & Tables

Topics

Statistics

0510'94'97'00'03'06'09'12'15'18
Citations per Year

96 Citations

Semantic Scholar estimates that this publication has 96 citations based on the available data.

See our FAQ for additional information.