Symbolic Greedy Best-First Search with Operator-Potential Heuristics
Proceedings of the International Symposium on Combinatorial Search · 14.08.2026 · 19 (1) · 36-46
DOI: 10.1609/socs.v19i1.43071 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the International Symposium on Combinatorial Search, online erschienen am 14.08.2026. Verfasst von Daniel Fišer und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Symbolic search has long been recognized as one of the state-of-the-art techniques for exhaustive state-space exploration and cost-optimal planning, leveraging compact state representations and efficient set-based operations. Despite its success in optimal planning, symbolic search has not traditionally been considered suitable for satisficing search, where heuristic guidance is paramount. In this paper, we investigate how to perform symbolic satisficing search aimed at efficiently finding good-quality solutions without guaranteeing optimality. We show that operator-potential heuristics are effective at guiding the search. Empirical results demonstrate that symbolic greedy best-first search with operator-potential heuristics is competitive with explicit state-space search.
Zitieren
APA
Fišer, D., & Torralba, Á. (2026). Symbolic Greedy Best-First Search with Operator-Potential Heuristics. Proceedings of the International Symposium on Combinatorial Search, 19(1), 36-46. https://doi.org/10.1609/socs.v19i1.43071
Vancouver
Fišer D, Torralba Á. Symbolic Greedy Best-First Search with Operator-Potential Heuristics. Proceedings of the International Symposium on Combinatorial Search. 2026;19(1):36-46. doi:10.1609/socs.v19i1.43071
BibTeX
@article{Fier2026,
author = {Fišer, Daniel and Torralba, Álvaro},
title = {Symbolic Greedy Best-First Search with Operator-Potential Heuristics},
journal = {Proceedings of the International Symposium on Combinatorial Search},
year = {2026},
volume = {19},
number = {1},
pages = {36--46},
doi = {10.1609/socs.v19i1.43071}
}
EUVIMED