TY - GEN
T1 - Laying the Foundations for Solving FOND HTN Problems
T2 - 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024
AU - Yousefi, Mohammad
AU - Bercher, Pascal
N1 - Publisher Copyright:
© 2024 International Joint Conferences on Artificial Intelligence. All rights reserved.
PY - 2024
Y1 - 2024
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85204286545&partnerID=8YFLogxK
U2 - 10.24963/ijcai.2024/751
DO - 10.24963/ijcai.2024/751
M3 - Conference contribution
AN - SCOPUS:85204286545
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 6796
EP - 6804
BT - Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024
A2 - Larson, Kate
PB - International Joint Conferences on Artificial Intelligence (IJCAI)
Y2 - 3 August 2024 through 9 August 2024
ER -