| Title: |
Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems) |
| Authors: |
Yousefi, Mohammad; Bercher, Pascal |
| Publisher Information: |
International Joint Conferences on Artificial Intelligence (IJCAI) |
| Publication Year: |
2024 |
| Collection: |
Australian National University: ANU Digital Collections |
| Description: |
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. ; Pascal Bercher is the recipient of an Australian Research Council (ARC) Discovery Early Career Researcher Award (DECRA), project number DE240101245, funded by the Australian Government. ; Peer-reviewed |
| Document Type: |
conference object |
| Language: |
English |
| ISBN: |
978-1-956792-04-1; 1-956792-04-X |
| Relation: |
Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024; 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024; IJCAI International Joint Conference on Artificial Intelligence; http://www.scopus.com/inward/record.url?scp=85204286545&partnerID=8YFLogxK; https://hdl.handle.net/1885/733756071; 85204286545 |
| DOI: |
10.24963/ijcai.2024/751 |
| Availability: |
https://hdl.handle.net/1885/733756071; http://www.scopus.com/inward/record.url?scp=85204286545&partnerID=8YFLogxK; https://doi.org/10.24963/ijcai.2024/751 |
| Rights: |
Publisher Copyright: © 2024 International Joint Conferences on Artificial Intelligence. All rights reserved. |
| Accession Number: |
edsbas.720FDB2E |
| Database: |
BASE |