Efficient HTN to STRIPS Encodings for Concurrent Planning - INSA Toulouse - Institut National des Sciences Appliquées de Toulouse Access content directly
Conference Papers Year : 2023

Efficient HTN to STRIPS Encodings for Concurrent Planning


The Hierarchical Task Network (HTN) formalism is used to express a wide variety of planning problems and many techniques have been proposed to solve them. 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 the first HTN to STRIPS encodings allowing to generate concurrent plans. We show experimentally that these encodings not only outperform previous approaches on hierarchical IPC benchmarks but also produce more expressive solution plans.
Fichier principal
Vignette du fichier
pellier23g.pdf (356.25 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04461427 , version 1 (16-02-2024)



Nicolas Cavrel, Damien Pellier, Humbert Fiorino. Efficient HTN to STRIPS Encodings for Concurrent Planning. 2023 IEEE 35th International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2023, Atlanta, France. pp.962-969, ⟨10.1109/ICTAI59109.2023.00144⟩. ⟨hal-04461427⟩
12 View
17 Download



Gmail Mastodon Facebook X LinkedIn More