HyperTensioN and Total-order Forward Decomposition optimizations

Maurício Cecílio Magnaguagno, Felipe Meneguzzi, Lavindra de Silva
7/1/2022
cs.AIcs.MAeess.SY

No confident code implementation found for this paper.

Abstract

Hierarchical Task Networks (HTN) planners generate plans using a decomposition process with extra domain knowledge to guide search towards a planning task. While domain experts develop HTN descriptions, they may repeatedly describe the same preconditions, or methods that are rarely used or possible to be decomposed. By leveraging a three-stage compiler design we can easily support more language descriptions and preprocessing optimizations that when chained can greatly improve runtime efficiency in such domains. In this paper we evaluate such optimizations with the HyperTensioN HTN planner, used in the HTN IPC 2020.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

The Planner Optimization Problem: Formulations and Frameworks

84% match2023

Lose the Order, Keep the Hierarchy: Deordering HTN Plans

83% match2026

Understanding the Capabilities of Large Language Models for Automated Planning

82% match2023

Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning

82% match1 repo332024

LeanPlan: Optimal Planning with LLM-Generated Heuristics and Admissibility Proofs

82% match1 repo72026

The Case for Developing a Foundation Model for Planning-like Tasks from Scratch

82% match2024

Cite this paper

@article{magnaguagno2022hypertension,
  title  = {HyperTensioN and Total-order Forward Decomposition optimizations},
  author = {Maurício Cecílio Magnaguagno and Felipe Meneguzzi and Lavindra de Silva},
  year   = {2022},
  eprint = {2207.00345},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.00345v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.00345.svg)](https://codeofpaper.com/paper/2207.00345)

Discussion