Analyzing tie-breaking strategies for the a* algorithm

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

For a given state space and admissible heuristic function h there is always a tie-breaking strategy for which A* expands the minimum number of states [Dechter and Pearl, 1985]. We say that these strategies have optimal expansion. Although such a strategy always exists it may depend on the instance, and we currently do not know a tie-breaker that always guarantees optimal expansion. In this paper, we study tie-breaking strategies for A*. We analyze common strategies from the literature and prove that they do not have optimal expansion. We propose a novel tie-breaking strategy using cost adaptation that has always optimal expansion. We experimentally analyze the performance of A* using several tie-breaking strategies on domains from the IPC and zero-cost domains. Our best strategy solves significantly more instances than the standard method in the literature and more than the previous state-of-the-art strategy. Our analysis improves the understanding of how to develop effective tie-breaking strategies and our results also improve the state-of-the-art of tie-breaking strategies for A.

Cite

CITATION STYLE

APA

Corrêa, A. B., Pereira, A. G., & Ritt, M. (2018). Analyzing tie-breaking strategies for the a* algorithm. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2018-July, pp. 4715–4721). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2018/655

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