Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems)

Mohammad Yousefi; Pascal Bercher

doi:10.24963/ijcai.2024/751

Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems)

Mohammad Yousefi, Pascal Bercher

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence

Main Track. Pages 6796-6804. https://doi.org/10.24963/ijcai.2024/751

PDF BibTeX

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.

Keywords:

Planning and Scheduling: PS: Hierarchical planning

Planning and Scheduling: PS: Planning algorithms

Planning and Scheduling: PS: Planning under uncertainty

Planning and Scheduling: PS: Search in planning and scheduling