Are we there yet? - Estimating search progress

Jordan T. Thayer, Roni Stern, Levi H.S. Lelis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Heuristic search is a general problem solving technique. While most evaluations of heuristic search focus on the speed of search, there are relatively few techniques for predicting when search will end. This paper provides a study of progress estimating techniques for optimal, suboptimal, and bounded suboptimal heuristic search algorithms. We examine two previously proposed techniques, search velocity and search vacillation, as well as two new approaches, path-based estimation and distribution-based estimation. We find that both new approaches are better at estimating the remaining amount of search effort than previous work in all three varieties of search, occasionally erring by less than 5%.

Original languageAmerican English
Title of host publicationProceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
Pages129-136
Number of pages8
StatePublished - 1 Dec 2012
Event5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canada
Duration: 19 Jul 201221 Jul 2012

Publication series

NameProceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

Conference

Conference5th International Symposium on Combinatorial Search, SoCS 2012
Country/TerritoryCanada
CityNiagara Falls, ON
Period19/07/1221/07/12

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this