Anytime Heuristic Search: Frameworks and Algorithms

Abstract

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… (More)

Topics

7 Figures and Tables

Cite this paper

@inproceedings{Thayer2010AnytimeHS, title={Anytime Heuristic Search: Frameworks and Algorithms}, author={Jordan Tyler Thayer and Wheeler Ruml}, booktitle={SOCS}, year={2010} }