Learning hierarchical task network domains from partially observed plan traces

DOI10.1016/J.ARTINT.2014.04.003zbMath1405.68333DBLPjournals/ai/ZhuoM014OpenAlexW1996913161WikidataQ59678205 ScholiaQ59678205MaRDI QIDQ2453731

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

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

HTN planningaction model learninglearning 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)

Related Items (4)

A constraint-based approach to learn temporal features on action models from multiple plans ⋮ Model-lite planning: case-based vs. model-based approaches ⋮ 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

Uses Software

• TRAMP
• SUPPLE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Task decomposition on abstract states, for planning under nondeterminism
• Learning action models from plan examples using weighted MAX-SAT
• Macro-operators: A weak method for learning
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• Action-model acquisition for planning via transfer learning
• STRIPS: A new approach to the application of theorem proving to problem solving
• Proximity-Based Non-uniform Abstractions for Approximate Planning
• Exploiting Cycle Structures in Max-SAT
• Inductive Logic Programming: Theory and methods
• An algorithm for information structuring and retrieval

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