IJCAI 2021poster2 citations
On Weak Stubborn Sets in Classical Planning
Abstract
Stubborn sets are a pruning technique for state-space search which is well established in optimal classical planning. In this paper, we show that weak stubborn sets introduced in recent work in planning are actually not weak stubborn sets in Valmari's original sense. Based on this finding, we introduce weak stubborn sets in the original sense for planning by providing a generalized definition analogously to generalized strong stubborn sets in previous work. We discuss the relationship of strong, weak and the previously called weak stubborn sets, thus providing a further step in getting an overall picture of the stubborn set approach in planning.
Planning and Scheduling: Planning AlgorithmsPlanning and Scheduling: Search in Planning and SchedulingPlanning and Scheduling: Theoretical Foundations of Planning
BibTeX
@inproceedings{ijcai2021p573,
title = {On Weak Stubborn Sets in Classical Planning},
author = {Sievers, Silvan and Wehrle, Martin},
booktitle = {Proceedings of the Thirtieth International Joint Conference on
Artificial Intelligence, {IJCAI-21}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Zhi-Hua Zhou},
pages = {4167--4174},
year = {2021},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2021/573},
url = {https://doi.org/10.24963/ijcai.2021/573},
}