\n
\n\n \n \n \n \n \n Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems).\n \n \n \n\n\n \n Mohammad Yousefi; and Pascal Bercher.\n\n\n \n\n\n\n In
Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024), 2024. IJCAI\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Yousefi2024FONDFoundations,\n author = {Mohammad Yousefi and Pascal Bercher},\n booktitle = {Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024)},\n title = {Laying the Foundations for Solving {FOND} {HTN} Problems: Grounding, Search, Heuristics (and Benchmark Problems)},\n year = {2024},\n Xpages = {},\n Xdoi = {},\n publisher = {IJCAI},\n abstract = {Building upon recent advancements in formalising Fully Observable Non-Deterministic (FOND) Hierarchical Task Network (HTN) planning, we present the first approach to find strong solutions for HTN problems with uncertainty in action outcomes. We present a search algorithm, along with a compilation that relaxes a FOND HTN problem to a deterministic one. This allows the utilisation of existing grounders and heuristics from the deterministic HTN planning literature.},\n Xurl_Paper = {},\n Xurl_Slides = {},\n Xurl_video_of_presentation = {}\n}\n\n
\n
\n\n\n
\n Building upon recent advancements in formalising Fully Observable Non-Deterministic (FOND) Hierarchical Task Network (HTN) planning, we present the first approach to find strong solutions for HTN problems with uncertainty in action outcomes. We present a search algorithm, along with a compilation that relaxes a FOND HTN problem to a deterministic one. This allows the utilisation of existing grounders and heuristics from the deterministic HTN planning literature.\n
\n\n\n
\n
\n\n \n \n \n \n \n A Visual Studio Code Extension for Automatically Repairing Planning Domains.\n \n \n \n\n\n \n Songtuan Lin; Mohammad Yousefi; and Pascal Bercher.\n\n\n \n\n\n\n In
ICAPS 2024 Demonstrations, 2024. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Lin2024VSPlugin,\n author = {Songtuan Lin and Mohammad Yousefi and Pascal Bercher},\n booktitle = {ICAPS 2024 Demonstrations},\n title = {A Visual Studio Code Extension for Automatically Repairing Planning Domains},\n year = {2024},\n abstract = {We demonstrate a Visual Studio Code extension which aims at providing modeling assistance for modeling planning domains in PDDL. More specifically, the extension can identify potential flaws in a domain and propose respective corrections by taking as input a set of counter-example plans, which are known to be valid but actually contradict the domain. Those input plans shall be provided by the user. The flaws are then identified and corrected by making changes to the domain so as to turn those plans into solutions, i.e., the changes are regarded as potential corrections to the domain. Currently, the extension only supports corrections that add predicates to or remove predicates from actions' preconditions and effects.}\n}\n
\n
\n\n\n
\n We demonstrate a Visual Studio Code extension which aims at providing modeling assistance for modeling planning domains in PDDL. More specifically, the extension can identify potential flaws in a domain and propose respective corrections by taking as input a set of counter-example plans, which are known to be valid but actually contradict the domain. Those input plans shall be provided by the user. The flaws are then identified and corrected by making changes to the domain so as to turn those plans into solutions, i.e., the changes are regarded as potential corrections to the domain. Currently, the extension only supports corrections that add predicates to or remove predicates from actions' preconditions and effects.\n
\n\n\n