Anytime Heuristic Search: Frameworks and Algorithms

  title={Anytime Heuristic Search: Frameworks and Algorithms},
  author={Jordan Tyler Thayer and Wheeler Ruml},
Anytime search is a pragmatic approach for trading solution cost and solving time. It can also be used for solving problems within a time bound. Three frameworks for constructing anytime algorithms from bounded suboptimal search have been proposed: continuing search, repairing search, and restarting search, but what combination of suboptimal search and anytime framework performs best? An extensive empirical evaluation results in several novel algorithms and reveals that the relative performance… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications referenced by this paper.
Showing 1-10 of 20 references

Anytime Heuristic Search

J. Artif. Intell. Res. • 2007
View 4 Excerpts
Highly Influenced

Limited Discrepancy Beam Search

IJCAI • 2005
View 5 Excerpts
Highly Influenced

Studies in Semi-Admissible Heuristics

IEEE Transactions on Pattern Analysis and Machine Intelligence • 1982
View 5 Excerpts
Highly Influenced

Heuristic Search Viewed as Path Finding in a Graph

Artif. Intell. • 1970
View 5 Excerpts
Highly Influenced

An ǫ-admissible heuristic search

S. Richter, J. Thayer, W. Ruml
View 1 Excerpt

Similar Papers

Loading similar papers…