Forward chaining hierarchical partial-order planning

DOI10.1007/978-3-030-66723-8_22MaRDI QIDQ3381983zbMATH OpenOpenAlexFDO

Authors Andrew Messing, Seth Hutchinson

Publication date 20 September 2021

Published in Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-66723-8_22

zbMATH Keywords

AI reasoninghierarchical task networkpartial-order planningtask planning

Mathematics Subject Classification ID

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

Recommendations

• TALplanner: A temporal logic based forward chaining planner
• scientific article; zbMATH DE number 2038905
• Publication:4506456
• scientific article; zbMATH DE number 2038903
• Fast planning through planning graph analysis

Cites work

• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• scientific article; zbMATH DE number 2038905 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• Planning in partially-observable switching-mode continuous domains
• Temporal constraint networks

Cited in

(5)

• Partial-order planning: Evaluating possible efficiency gains
• Partial-order planning with concurrent interacting actions
• scientific article; zbMATH DE number 2038905 (Why is no real title available?)
• scientific article; zbMATH DE number 773978 (Why is no real title available?)
• Enhancing temporal planning by sequential macro-actions

Describes a project that uses

Uses Software

• UCPOP
• VHPOP

This page was built for publication: Forward chaining hierarchical partial-order planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3381983)