@inproceedings{9212a87f6a6a4ac494dd143651509cc9,
title = "Compiling HTN Plan Verification Problems into HTN Planning Problems",
abstract = "Plan Verification is the task of deciding whether a sequence of actions is a solution for a given planning problem. In HTN planning, the task is computationally expensive and may be up to NP-hard. However, there are situations where it needs to be solved, e.g. when a solution is post-processed, in systems using approximation, or just to validate whether a planning system works correctly (e.g. for debugging or in a competition). There are verification systems based on translations to propositional logic and on techniques from parsing. Here we present a third approach and translate HTN plan verification problems into HTN planning problems. These can be solved using any HTN planning system. We collected a new benchmark set based on models and results of the 2020 International Planning Competition. Our evaluation shows that our compilation outperforms the approaches from the literature.",
author = "Daniel H{\"o}ller and Julia Wichlacz and Pascal Bercher and Gregor Behnke",
note = "Publisher Copyright: {\textcopyright} 2022, Association for the Advancement of Artificial Intelligence.; 32nd International Conference on Automated Planning and Scheduling, ICAPS 2022 ; Conference date: 13-06-2022 Through 24-06-2022",
year = "2022",
month = jun,
day = "13",
doi = "10.1609/icaps.v32i1.19795",
language = "English",
isbn = "978-1-57735-874-9",
volume = "32",
series = "Proceedings of the International Conference on Automated Planning and Scheduling",
publisher = "American Association for Artificial Intelligence (AAAI) Press",
pages = "145--150",
editor = "Akshat Kumar and Sylvie Thi{\'e}baux and Pradeep Varakantham and William Yeoh",
booktitle = "Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022)",
}