Using Distance Estimates in Heuristic Search : A Re-evaluation

@inproceedings{Thayer2009UsingDE,
  title={Using Distance Estimates in Heuristic Search : A Re-evaluation},
  author={Jordan Tyler Thayer and Wheeler Ruml and Jeff Kreis},
  year={2009}
}
Traditionally, heuristic search algorithms have relied on an estimate of the cost-to-go to speed up problem-solving. In many domains, operators have different costs and estimated cost-to-go is not the same as estimated search-distance-togo. We investigate further accelerating search by using a distance-to-go function. We evaluate two previous proposals: Dynamically weighted A ∗ and A∗ ǫ . We present a revision to dynamically weighted A ∗ which improves its performance substantially in domains… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS