Compiling HTN Plan Verification Problems into HTN Planning Problems. Höller, D., Wichlacz, J., Bercher, P., & Behnke, G. In Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), pages 145–150, 2022. AAAI Press.
![Compiling HTN Plan Verification Problems into HTN Planning Problems [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper Poster ![Compiling HTN Plan Verification Problems into HTN Planning Problems [link]](https://bibbase.org/img/filetypes/link.svg "link")
Video of presentation doi abstract bibtex 8 downloads
Paper Poster Video of presentation doi abstract bibtex 8 downloads 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, 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.
@InProceedings{Hoeller2022VerifyViaPlanning,
author = {Daniel H\"oller and Julia Wichlacz and Pascal Bercher and Gregor Behnke},
booktitle = {Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022)},
title = {Compiling HTN Plan Verification Problems into HTN Planning Problems},
year = {2022},
pages = {145--150},
publisher = {AAAI Press},
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, 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.},
doi = {10.1609/icaps.v32i1.19795},
url_Paper = {https://bercher.net/publications/2022/Hoeller2022VerificationViaCompilation.pdf},
url_poster = {http://icaps22.icaps-conference.org/posters/hoeller_MTS15.pdf},
url_video_of_presentation = {http://icaps22.icaps-conference.org/papers/15/index.html},
keywords = {conference}
}Downloads: 8
{"_id":"gMJgA5xSvDLRMpiQg","bibbaseid":"hller-wichlacz-bercher-behnke-compilinghtnplanverificationproblemsintohtnplanningproblems-2022","author_short":["Höller, D.","Wichlacz, J.","Bercher, P.","Behnke, G."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Daniel"],"propositions":[],"lastnames":["Höller"],"suffixes":[]},{"firstnames":["Julia"],"propositions":[],"lastnames":["Wichlacz"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]},{"firstnames":["Gregor"],"propositions":[],"lastnames":["Behnke"],"suffixes":[]}],"booktitle":"Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022)","title":"Compiling HTN Plan Verification Problems into HTN Planning Problems","year":"2022","pages":"145–150","publisher":"AAAI Press","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, 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.","doi":"10.1609/icaps.v32i1.19795","url_paper":"https://bercher.net/publications/2022/Hoeller2022VerificationViaCompilation.pdf","url_poster":"http://icaps22.icaps-conference.org/posters/hoeller_MTS15.pdf","url_video_of_presentation":"http://icaps22.icaps-conference.org/papers/15/index.html","keywords":"conference","bibtex":"@InProceedings{Hoeller2022VerifyViaPlanning,\n author = {Daniel H\\\"oller and Julia Wichlacz and Pascal Bercher and Gregor Behnke},\n booktitle = {Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022)},\n title = {Compiling HTN Plan Verification Problems into HTN Planning Problems},\n year = {2022},\n pages = {145--150},\n publisher = {AAAI Press},\n 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, 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.},\n doi = {10.1609/icaps.v32i1.19795},\n url_Paper = {https://bercher.net/publications/2022/Hoeller2022VerificationViaCompilation.pdf},\n url_poster = {http://icaps22.icaps-conference.org/posters/hoeller_MTS15.pdf},\n url_video_of_presentation = {http://icaps22.icaps-conference.org/papers/15/index.html},\n keywords = {conference}\n}\n\n","author_short":["Höller, D.","Wichlacz, J.","Bercher, P.","Behnke, G."],"key":"Hoeller2022VerifyViaPlanning","id":"Hoeller2022VerifyViaPlanning","bibbaseid":"hller-wichlacz-bercher-behnke-compilinghtnplanverificationproblemsintohtnplanningproblems-2022","role":"author","urls":{" paper":"https://bercher.net/publications/2022/Hoeller2022VerificationViaCompilation.pdf"," poster":"http://icaps22.icaps-conference.org/posters/hoeller_MTS15.pdf"," video of presentation":"http://icaps22.icaps-conference.org/papers/15/index.html"},"keyword":["conference"],"metadata":{"authorlinks":{}},"downloads":8},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["zKgS72cAu6Ez7npdh","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["conference"],"search_terms":["compiling","htn","plan","verification","problems","htn","planning","problems","höller","wichlacz","bercher","behnke"],"title":"Compiling HTN Plan Verification Problems into HTN Planning Problems","year":2022,"downloads":8}