Avoiding Re-Expansions in Suboptimal Best-First Search

Authors

  • Jingwei Chen University of Alberta
  • Nathan R. Sturtevant University of Alberta

DOI:

https://doi.org/10.1609/socs.v12i1.18570

Keywords:

Time, Memory, And Solution Quality Trade-offs

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.
SoCS-2021 Proceedings Cover

Downloads

Published

2021-07-22

How to Cite

Chen, J., & Sturtevant, N. R. (2021). Avoiding Re-Expansions in Suboptimal Best-First Search. Proceedings of the International Symposium on Combinatorial Search, 12(1), 162–163. https://doi.org/10.1609/socs.v12i1.18570

Issue

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

Section

Extended Abstracts