TY - GEN
T1 - Are we there yet? - Estimating search progress
AU - Thayer, Jordan T.
AU - Stern, Roni
AU - Lelis, Levi H.S.
PY - 2012/12/1
Y1 - 2012/12/1
N2 - 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%.
AB - 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%.
UR - http://www.scopus.com/inward/record.url?scp=84893428342&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9781577355847
T3 - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
SP - 129
EP - 136
BT - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
T2 - 5th International Symposium on Combinatorial Search, SoCS 2012
Y2 - 19 July 2012 through 21 July 2012
ER -