Conference ProceedingsOPEN ACCESS

A guide to budgeted tree search

Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020 (2020) 75-81
DOI: 10.1609/socs.v11i1.18537
2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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 search layers grow 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.

Cite

CITATION STYLE

APA

Sturtevant, N. R., & Helmert, M. (2020). A guide to budgeted tree search. In Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020 (pp. 75–81). The AAAI Press. https://doi.org/10.1609/socs.v11i1.18537

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free