The Joy of Forgetting: Faster Anytime Search via Restarting
ICAPS, pp. 137-144, 2010.
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then find- ing improved solutions when given additional time. To de- liver a solution quickly, they are typically greedy with re- spect to the heuristic cost-to-go estimate h. In this paper, we first show that this low-h bias can cau...More
Full Text (Upload PDF)
PPT (Upload PPT)