A Guide to Budgeted Tree Search
Full Text: 18520-79346-1-PB.pdf
Budgeted Tree Search (BTS), a variant of Iterative Budgeted Exponential Search, is a new algorithm that has the same performance as IDA* on problems where the state space grows exponentially, but has far better performance than IDA* in other cases where IDA* fails. The goal of this paper is to provide a detailed guide to BTS with worked examples to make the algorithm more accessible to practitioners in heuristic search.
Citation
N. Sturtevant, M. Helmert. "A Guide to Budgeted Tree Search". Symposium on Combinatorial Search, (ed: Daniel Harabor, Mauro Vallati), pp 75-81, May 2020.| Keywords: | |
| Category: | In Conference |
| Web Links: | AAAI |
BibTeX
@incollection{Sturtevant+Helmert:SoCS20,
author = {Nathan R. Sturtevant and Malte Helmert},
title = {A Guide to Budgeted Tree Search},
Editor = {Daniel Harabor, Mauro Vallati},
Pages = {75-81},
booktitle = {Symposium on Combinatorial Search},
year = 2020,
}Last Updated: September 10, 2020Submitted by Sabina P
