# On Guiding Search in HTN Temporal Planning with non Temporal Heuristics

arXiv: https://arxiv.org/abs/2306.07638 · HTML: https://mlsanity.com/paper/2306.07638/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 23 references that are in the map.
- First posted on arXiv 13 Jun 2023.

## Builds on (most cited first, 3 of 3)

- [FAPE: a Constraint-based Planner for Generative and Hierarchical Temporal Planning](https://mlsanity.com/paper/2010.13121/) (2020)
- [Formal Semantics and Formally Verified Validation for Temporal Planning](https://mlsanity.com/paper/2203.13604/) (2022)
- [HDDL 2.1: Towards Defining an HTN Formalism with Time](https://mlsanity.com/paper/2206.01822/) (2022)

## Abstract (arXiv)

The Hierarchical Task Network (HTN) formalism is used to express a wide variety of planning problems as task decompositions, and many techniques have been proposed to solve them. However, few works have been done on temporal HTN. This is partly due to the lack of a formal and consensual definition of what a temporal hierarchical planning problem is as well as the difficulty to develop heuristics in this context. In response to these inconveniences, we propose in this paper a new general POCL (Partial Order Causal Link) approach to represent and solve a temporal HTN problem by using existing heuristics developed to solve non temporal problems. We show experimentally that this approach is performant and can outperform the existing ones.