TY - GEN

T1 - Predicting solution cost with conditional probabilities

AU - Lelis, Levi

AU - Stern, Roni

AU - Arfaee, Shahab Jabbari

PY - 2011/12/1

Y1 - 2011/12/1

N2 - Classical heuristic search algorithms find the solution cost of a problem while finding the path from the start state to a goal state. However, there are applications in which finding the path is not needed. In this paper we propose an algorithm that accurately and efficiently predicts the solution cost of a problem without finding the actual solution. We show empirically that our predictor makes more accurate predictions when compared to the bootstrapped heuristic, which is known to be a very accurate inadmissible heuristic. In addition, we show how our prediction algorithm can be used to enhance heuristic search algorithms. Namely, we use our predictor to calculate a bound for a bounded best-first search algorithm and to tune the w-value of Weighted IDA*. In both cases major search speedups were observed.

AB - Classical heuristic search algorithms find the solution cost of a problem while finding the path from the start state to a goal state. However, there are applications in which finding the path is not needed. In this paper we propose an algorithm that accurately and efficiently predicts the solution cost of a problem without finding the actual solution. We show empirically that our predictor makes more accurate predictions when compared to the bootstrapped heuristic, which is known to be a very accurate inadmissible heuristic. In addition, we show how our prediction algorithm can be used to enhance heuristic search algorithms. Namely, we use our predictor to calculate a bound for a bounded best-first search algorithm and to tune the w-value of Weighted IDA*. In both cases major search speedups were observed.

UR - http://www.scopus.com/inward/record.url?scp=84893392829&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84893392829

SN - 9781577355373

T3 - Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

SP - 100

EP - 107

BT - Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

T2 - 4th International Symposium on Combinatorial Search, SoCS 2011

Y2 - 15 July 2011 through 16 July 2011

ER -