Programming hierarchical task networks in the situation calculus
From MaRDI portal
Publication:5740441
zbMATH Open1341.68200MaRDI QIDQ5740441FDOQ5740441
Authors: Alfredo Gabaldon 
Publication date: 26 July 2016
Recommendations
- On hierarchical task networks
- Planning in answer set programming using ordered task decomposition
- Planning in answer set programming using ordered task decomposition
- Planning under uncertainty as G<scp>OLOG</scp>programs
- HTN-like solutions for classical planning problems: an application to BDI agent systems
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)
Cited In (11)
- HTN-like solutions for classical planning problems: an application to BDI agent systems
- Planning in answer set programming using ordered task decomposition
- On hierarchical task networks
- Title not available (Why is that?)
- Learning hierarchical task models from input traces
- Title not available (Why is that?)
- Language classification of hierarchical planning problems
- Mobile robot planning using action language \({\mathcal {BC}}\) with an abstraction hierarchy
- Learning hierarchical task network domains from partially observed plan traces
- Enhancing temporal planning by sequential macro-actions
- Title not available (Why is that?)
Uses Software
This page was built for publication: Programming hierarchical task networks in the situation calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740441)
