Laying the Foundations for Solving FOND HTN Problems
Date
Authors
Yousefi, Mohammad
Bercher, Pascal
Journal Title
Journal ISSN
Volume Title
Publisher
International Joint Conferences on Artificial Intelligence (IJCAI)
Access Statement
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.
Description
Keywords
Citation
Collections
Source
Type
Book Title
Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024
Entity type
Publication