A stubborn set algorithm for optimal planning

Alkhazraji, Yusra and Wehrle, Martin and Mattmüller, Robert and Helmert, Malte. (2012) A stubborn set algorithm for optimal planning. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012). [s.l.], pp. 891-892.

Full text not available from this repository.

Official URL: http://edoc.unibas.ch/dok/A6043815

Downloads: Statistics Overview


We adapt a partial order reduction technique based on stubborn sets, originally proposed for detecting dead ends in Petri Nets, to the setting of optimal planning. We demonstrate that stubborn sets can provide significant state space reductions on standard planning benchmarks, outperforming the expansion core method.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Helmert, Malte and Wehrle, Martin
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:IOS Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
Last Modified:13 Sep 2013 07:59
Deposited On:13 Sep 2013 07:57

Repository Staff Only: item control page