Programming hierarchical task networks in the situation calculus

zbMATH Open1341.68200MaRDI QIDQ5740441FDOQ5740441

Authors Alfredo Gabaldon 

Publication date 26 July 2016

zbMATH Keywords

planninghierarchical task networks

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

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

Cited in

(11)

• Learning hierarchical task models from input traces
• Enhancing temporal planning by sequential macro-actions
• Learning hierarchical task network domains from partially observed plan traces
• HTN-like solutions for classical planning problems: an application to BDI agent systems
• On hierarchical task networks
• Language classification of hierarchical planning problems
• scientific article; zbMATH DE number 2085256 (Why is no real title available?)
• Planning in answer set programming using ordered task decomposition
• scientific article; zbMATH DE number 1949002 (Why is no real title available?)
• Mobile robot planning using action language \({\mathcal {BC}}\) with an abstraction hierarchy
• scientific article; zbMATH DE number 1629872 (Why is no real title available?)

Describes a project that uses

Uses Software

• GOLOG

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)