A Stubborn Set Algorithm for Optimal Planning

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.

Authors

• Yusra Alkhazraji
• Martin Wehrle
• Robert Mattmüller
• Malte Helmert

Keywords

No keywords are indexed for this paper.