Forward chaining hierarchical partial-order planning

DOI10.1007/978-3-030-66723-8_22zbMATH Open1469.68129OpenAlexW3128077179MaRDI QIDQ3381983FDOQ3381983

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

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

zbMATH Keywords

task planninghierarchical task networkpartial-order planningAI reasoning

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Planning in partially-observable switching-mode continuous domains
• Temporal constraint networks
• Title not available (Why is that?)
• Branching and pruning: An optimal temporal POCL planner based on constraint programming

Cited In (5)

• Partial-order planning: Evaluating possible efficiency gains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enhancing temporal planning by sequential macro-actions
• Partial-order planning with concurrent interacting actions

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)