# Totally and Partially Ordered Hierarchical Planners in PDDL4J Library

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Nov 2020.

## Built on by (most cited first, 1 of 1)

- [An Accurate HDDL Domain Learning Algorithm from Partial and Noisy Observations](https://mlsanity.com/paper/2206.06882/) (2022)

## Abstract (arXiv)

In this paper, we outline the implementation of the TFD (Totally Ordered Fast Downward) and the PFD (Partially ordered Fast Downward) hierarchical planners that participated in the first HTN IPC competition in 2020. These two planners are based on forward-chaining task decomposition coupled with a compact grounding of actions, methods, tasks and HTN problems.