TY - GEN
T1 - Faster bounded-cost search using inadmissible estimates
AU - Thayer, Jordan T.
AU - Stern, Roni
AU - Felner, Ariel
AU - Ruml, Wheeler
PY - 2012/9/25
Y1 - 2012/9/25
N2 - Many important problems are too difficult to solve optimally. A traditional approach to such problems is bounded suboptimal search, which guarantees solution costs within a user-specified factor of optimal. Recently, a complementary approach has been proposed: bounded-cost search, where solution cost is required to be below a user-specified absolute bound. In this paper, we show how bounded-cost search can incorporate inadmissible estimates of solution cost and solution length. This information has previously been shown to improve bounded suboptimal search and, in an empirical evaluation over five benchmark domains, we find that our new algorithms surpass the state-of-the-art in bounded-cost search as well, particularly for domains where action costs differ.
AB - Many important problems are too difficult to solve optimally. A traditional approach to such problems is bounded suboptimal search, which guarantees solution costs within a user-specified factor of optimal. Recently, a complementary approach has been proposed: bounded-cost search, where solution cost is required to be below a user-specified absolute bound. In this paper, we show how bounded-cost search can incorporate inadmissible estimates of solution cost and solution length. This information has previously been shown to improve bounded suboptimal search and, in an empirical evaluation over five benchmark domains, we find that our new algorithms surpass the state-of-the-art in bounded-cost search as well, particularly for domains where action costs differ.
UR - http://www.scopus.com/inward/record.url?scp=84866457827&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84866457827
SN - 9781577355625
T3 - ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling
SP - 270
EP - 278
BT - ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling
T2 - 22nd International Conference on Automated Planning and Scheduling, ICAPS 2012
Y2 - 25 June 2012 through 29 June 2012
ER -