Gregor Behnke

Assessing the Expressivity of Planning Formalisms through the Comparison to Formal Languages

2016 · Proceedings of the International Conference on Automated Planning and Scheduling

From a theoretical perspective, judging the expressivity of planning formalisms helps to understand the relationship of different representations and to infer theoretical properties. From a practical point of view, it is important to be able …

Block Compression and Invariant Pruning for SAT-based Totally-Ordered HTN Planning

2021 · Proceedings of the International Conference on Automated Planning and Scheduling

Translations into propositional logic are currently one of the most efficient techniques for solving Totally-Ordered HTN planning problems. The two current encodings both iterate over the maximum allowed depth of decomposition. Given this depth, they …