Learning hierarchical task network domains from partially observed plan traces

DOI10.1016/J.ARTINT.2014.04.003MaRDI QIDQ2453731zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hankz Hankui Zhuo, Héctor Muñoz-Avila, Qiang Yang

Publication date 10 June 2014

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2014.04.003

zbMATH Keywords

action model learningHTN planninglearning HTNsweighted MAX-SAT

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Learning hierarchical task models from input traces
• On hierarchical task networks
• Programming hierarchical task networks in the situation calculus
• Review on hierarchical task network planning under uncertainty
• Learning action models from plan examples using weighted MAX-SAT

Cites work

• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Action-model acquisition for planning via transfer learning
• An algorithm for information structuring and retrieval
• Exploiting Cycle Structures in Max-SAT
• scientific article; zbMATH DE number 5547890 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• scientific article; zbMATH DE number 2243407 (Why is no real title available?)
• Inductive Logic Programming: Theory and methods
• Learning action models from plan examples using weighted MAX-SAT
• Macro-operators: A weak method for learning
• Marvin: a heuristic search planner with online macro-action learning
• New inference rules for Max-SAT
• Proximity-based non-uniform abstractions for approximate planning
• STRIPS: A new approach to the application of theorem proving to problem solving
• Task decomposition on abstract states, for planning under nondeterminism

Cited in

(8)

• A semi-Markov decision model for recognizing the destination of a maneuvering agent in real time strategy games
• Gradient-based mixed planning with symbolic and numeric action parameters
• A constraint-based approach to learn temporal features on action models from multiple plans
• Model-lite planning: case-based vs. model-based approaches
• Learning goal hierarchies from structured observations and expert annotations
• Review on hierarchical task network planning under uncertainty
• Exploiting expert knowledge in factored POMDPs
• Learning hierarchical task models from input traces

Describes a project that uses

Uses Software

• TRAMP
• SUPPLE

This page was built for publication: Learning hierarchical task network domains from partially observed plan traces

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