# An Efficient HTN to STRIPS Encoding for Concurrent Plans

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 21 references that are in the map.
- First posted on arXiv 14 Jun 2022.

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

- [HTN Planning Domain for Deployment of Cloud Applications](https://mlsanity.com/paper/2104.10027/) (2021)

## Abstract (arXiv)

The Hierarchical Task Network (HTN) formalism is used to express a wide variety of planning problems in terms of decompositions of tasks into subtaks. Many techniques have been proposed to solve such hierarchical planning problems. A particular technique is to encode hierarchical planning problems as classical STRIPS planning problems. One advantage of this technique is to benefit directly from the constant improvements made by STRIPS planners. However, there are still few effective and expressive encodings. In this paper, we present a new HTN to STRIPS encoding allowing to generate concurrent plans. We show experimentally that this encoding outperforms previous approaches on hierarchical IPC benchmarks.