An Atom-Centric Perspective on Stubborn Sets

Röger, Gabriele and Helmert, Malte and Seipp, Jendrik and Sievers, Silvan. (2020) An Atom-Centric Perspective on Stubborn Sets. In: Proceedings of the 13th Annual Symposium on Combinatorial Search (SoCS 2020). pp. 57-65.

[img] PDF - Accepted Version

Official URL: https://edoc.unibas.ch/78736/

Downloads: Statistics Overview


Stubborn sets are an optimality-preserving pruning technique for factored state-space search, for example in classical planning. Their applicability is limited by their computational overhead. We describe a new algorithm for computing stubborn sets that is based on the state variables of the state space, while previous algorithms are based on its actions. Typical factored state spaces tend to have far fewer state variables than actions, and therefore our new algorithm is much more efficient than the previous state of the art, making stubborn sets a viable technique in many cases where they previously were not.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Röger, Gabriele and Helmert, Malte and Seipp, Jendrik and Sievers, Silvan
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:27 Aug 2021 10:29
Deposited On:27 Jan 2021 11:27

Repository Staff Only: item control page