Iterative Budgeted Exponential Search

IJCAI, pp. 1249-1257, 2019.

Cited by: 4|Bibtex|Views39|DOI:https://doi.org/10.24963/ijcai.2019/174
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

We tackle two long-standing problems related to re-expansions in heuristic search algorithms. For graph search, A* can require $\Omega(2^{n})$ expansions, where $n$ is the number of states within the final $f$ bound. Existing algorithms that address this problem like B and B' improve this bound to $\Omega(n^2)$. For tree search, IDA* ca...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments