On Succinct Groundings of HTN Planning Problems
Gregor Behnke, Daniel Höller, Alexander Schmid, Pascal Bercher, Susanne Biundo
Abstract
Both search-based and translation-based planning systems usually operate on grounded representations of the problem. Planning models, however, are commonly defined using lifted description languages. Thus, planning systems usually generate a grounded representation of the lifted model as a preprocessing step. For HTN planning models, only one method to ground lifted models has been published so far. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings in a shorter timespan than the previously published method.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 050287e5-1ba0-4818-bc21-17e6f4b92bf9Cited by top-tier papers6
- HDDL: An Extension to PDDL for Expressing Hierarchical Planning ProblemsDaniel Höller, Gregor Behnke, Pascal Bercher, Susanne Biundo et al.AAAI 2020 · 111 citations
- Making Translations to Classical Planning Competitive with Other HTN PlannersGregor Behnke, Florian Pollitt, Daniel Höller, Pascal Bercher et al.AAAI 2022 · 16 citations
- Symbolic Search for Optimal Total-Order HTN PlanningGregor Behnke, David SpeckAAAI 2021 · 12 citations
- Probabilistic Hierarchical Goal Network Planning with UCTDavid H. Chan, Mark Roberts, Dana S. NauAAAI 2026
- Automated Repair of Totally-Ordered Hierarchical Task Network Domains via Context-Free Grammars with Large Language Model SupportDaniel Lutalo, Pascal BercherAAAI 2026
Related papers
- Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation HeuristicsRostislav Horcík, Daniel Fiser, Álvaro TorralbaAAAI 2022 · 6 citations
- Learning Heuristic Functions for HTN PlanningDaniel HöllerAAAI 2026
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan ExistenceSongtuan Lin, Conny Olz, Malte Helmert, Pascal BercherAAAI 2024 · 3 citations
- Learning Domain-Independent Heuristics for Grounded and Lifted PlanningDillon Ze Chen, Sylvie Thiébaux, Felipe W. TrevizanAAAI 2024 · 29 citations
- Optimizing the Optimization of Planning Domains by Automatic Action Schema SplittingMojtaba Elahi, Jussi RintanenAAAI 2024 · 3 citations
