Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems)
| dc.contributor.author | Yousefi, Mohammad | en |
| dc.contributor.author | Bercher, Pascal | en |
| dc.date.accessioned | 2025-05-31T05:29:20Z | |
| dc.date.available | 2025-05-31T05:29:20Z | |
| dc.date.issued | 2024 | en |
| dc.description.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. | en |
| dc.description.sponsorship | 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. | en |
| dc.description.status | Peer-reviewed | en |
| dc.format.extent | 9 | en |
| dc.identifier.isbn | 9781956792041 | en |
| dc.identifier.issn | 1045-0823 | en |
| dc.identifier.other | ORCID:/0000-0002-0795-4320/work/177885428 | en |
| dc.identifier.scopus | 85204286545 | en |
| dc.identifier.uri | http://www.scopus.com/inward/record.url?scp=85204286545&partnerID=8YFLogxK | en |
| dc.identifier.uri | https://hdl.handle.net/1885/733756071 | |
| dc.language.iso | en | en |
| dc.publisher | International Joint Conferences on Artificial Intelligence (IJCAI) | en |
| dc.relation.ispartof | Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024 | en |
| dc.relation.ispartofseries | 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024 | en |
| dc.relation.ispartofseries | IJCAI International Joint Conference on Artificial Intelligence | en |
| dc.rights | Publisher Copyright: © 2024 International Joint Conferences on Artificial Intelligence. All rights reserved. | en |
| dc.title | Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems) | en |
| dc.type | Conference paper | en |
| dspace.entity.type | Publication | en |
| local.bibliographicCitation.lastpage | 6804 | en |
| local.bibliographicCitation.startpage | 6796 | en |
| local.contributor.affiliation | Yousefi, Mohammad; School of Computing, ANU College of Systems and Society, The Australian National University | en |
| local.contributor.affiliation | Bercher, Pascal; School of Computing, ANU College of Systems and Society, The Australian National University | en |
| local.identifier.doi | 10.24963/ijcai.2024/751 | en |
| local.identifier.pure | e17150de-c3e2-441d-a0e0-3d944bc0ef01 | en |
| local.identifier.url | https://www.scopus.com/pages/publications/85204286545 | en |
| local.type.status | Published | en |