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

Mohammad Yousefi; Pascal Bercher

IJCAI 2024poster1 citations

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

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.

Planning and Scheduling: PS: Hierarchical planningPlanning and Scheduling: PS: Planning algorithmsPlanning and Scheduling: PS: Planning under uncertaintyPlanning and Scheduling: PS: Search in planning and scheduling

BibTeX

@inproceedings{ijcai2024p751,
  title     = {Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems)},
  author    = {Yousefi, Mohammad and Bercher, Pascal},
  booktitle = {Proceedings of the Thirty-Third International Joint Conference on
               Artificial Intelligence, {IJCAI-24}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},
  editor    = {Kate Larson},
  pages     = {6796--6804},
  year      = {2024},
  month     = {8},
  note      = {Main Track},
  doi       = {10.24963/ijcai.2024/751},
  url       = {https://doi.org/10.24963/ijcai.2024/751},
}