AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the International Symposium on Combinatorial Search, 14

Avoiding Re-Expansions in Suboptimal Best-First Search

Authors

Jingwei Chen,Nathan R. Sturtevant

University of Alberta,University of Alberta


Proceedings:

Proceedings of the International Symposium on Combinatorial Search, 14

Volume

Issue:

Vol. 14 No. 1 (2021): Fourteenth International Symposium on Combinatorial Search

Track:

Extended Abstracts

Downloads:

Download PDF

Abstract:

This paper gives a summary of published conditions needed for a priority function to return bounded-optimal solutions when not performing re-expansions of previously expanded states in best-first search.

DOI:

10.1609/socs.v12i1.18570


SOCS

Vol. 14 No. 1 (2021): Fourteenth International Symposium on Combinatorial Search