Research map / Learning theory and algorithms / Combinatorial and search optimization
On Succinct Groundings of HTN Planning Problems
Gregor Behnke, Daniel Höller, Alexander Schmid, Pascal Bercher, Susanne Biundo
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use pandaPI grounder instead of PANDA's grounder | HTN grounding · 330 instances | grounding time: avg. 98.55% reduction | Improved |
| use pandaPI instead of GTOHP grounder | HTN grounding · 228 totally-ordered instances | grounding time: avg. 80.17% reduction | Improved |
| use pandaPI instead of Tree-Rex grounder | HTN grounding · 228 totally-ordered instances | grounding time: avg. 83.39% reduction | Improved |
| use pandaPI instead of GTOHP grounder | HTN grounding · grounding size | primitive tasks: avg. 50.62% reduction | Improved |
| use pandaPI instead of Tree-Rex grounder | HTN grounding · grounding size | abstract tasks: avg. 16.40% reduction; better 108, worse 91 | Mixed |
| use pandaPI instead of Tree-Rex grounder | HTN grounding · grounding size | methods: avg. 36.19% reduction; better 148, worse 51 | Mixed |
| use pandaPI instead of PANDA grounder | HTN grounding · grounding size | primitive tasks: 0.00 | No clear effect |
| use pandaPI instead of PANDA grounder | HTN grounding · abstract tasks | count: avg. 6.86% reduction; better 132, worse 101 | Mixed |
| use pandaPI planning graph instead of Fast Downward Datalog grounder | classical SATELLITE · instances #31-#36 | grounding time: 38.765s -> 1.339s | Improved |
Closest papers by meaning
- Learning Heuristic Functions for HTN Planning (AAAI 2026 · similarity 0.89)
- Making Translations to Classical Planning Competitive with Other HTN Planners (AAAI 2022 · similarity 0.88)
- Semantic Attachments for HTN Planning (AAAI 2020 · similarity 0.88)
- Learning Domain-Independent Heuristics for Grounded and Lifted Planning (AAAI 2024 · similarity 0.86)
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence (AAAI 2024 · similarity 0.85)
- Planning Anything with Rigor: General-Purpose Zero-Shot Planning with LLM-based Formalized Programming (ICLR 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
