On hierarchical task networks
From MaRDI portal
Publication:2835901
DOI10.1007/978-3-319-48758-8_38zbMATH Open1483.68353OpenAlexW2541604805MaRDI QIDQ2835901FDOQ2835901
Authors: Andreas Herzig, Laurent Perrussel, Zhanhao Xiao 
Publication date: 30 November 2016
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://oatao.univ-toulouse.fr/18803/1/herzig_18803.pdf
Recommendations
- Programming hierarchical task networks in the situation calculus
- Complexity results for HTN planning
- Planning in answer set programming using ordered task decomposition
- More than a name? on implications of preconditions and effects of compound HTN planning tasks
- Review on hierarchical task network planning under uncertainty
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)
Cites Work
Cited In (13)
- HTN-like solutions for classical planning problems: an application to BDI agent systems
- Planning in answer set programming using ordered task decomposition
- Lilotane: a lifted SAT-based approach to hierarchical planning
- Review on hierarchical task network planning under uncertainty
- Planning with independent task networks
- Programming hierarchical task networks in the situation calculus
- Refinement of intentions
- Learning hierarchical task models from input traces
- Title not available (Why is that?)
- Language classification of hierarchical planning problems
- Learning hierarchical task network domains from partially observed plan traces
- Planning in answer set programming using ordered task decomposition
- Title not available (Why is that?)
Uses Software
This page was built for publication: On hierarchical task networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835901)
