Heuristic Search Viewed as Path Finding in a Graph

@article{Pohl1970HeuristicSV,
  title={Heuristic Search Viewed as Path Finding in a Graph},
  author={Ira Pohl},
  journal={Artif. Intell.},
  year={1970},
  volume={1},
  pages={193-204}
}
Abstract This paper presents a particular model of heuristic search as a path-finding problem in a directed graph. A class of graph-searching procedures is described which uses a heuristic function to guide search. Heuristic functions are estimates of the number of edges that remain to be traversed in reaching a goal node. A number of theoretical results for this model, and the intuition for these results, are presented. They relate the efficiency of search to the accuracy of the heuristic… CONTINUE READING
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 224 CITATIONS

Methods for advancing combinatorial optimization over graphical models

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Weighted heuristic anytime search: new schemes for optimization over graphical models

  • Annals of Mathematics and Artificial Intelligence
  • 2015
VIEW 18 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Weighted Best First Search for Graphical Models

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Are We There Yet? - Estimating Search Progress

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Heuristic search under time and cost bounds

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1971
2019

CITATION STATISTICS

  • 33 Highly Influenced Citations

  • Averaged 14 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

Similar Papers

Loading similar papers…