Learning Hierarchical Task Models by Demonstration (subsumed by TR2002-04)

    •  Andrew Garland and Neal Lesh, "Learning Hierarchical Task Models by Demonstration (subsumed by TR2002-04)", Tech. Rep. TR2001-03, Mitsubishi Electric Research Laboratories, Cambridge, MA, January 2001.
      BibTeX TR2001-03 PDF
      • @techreport{MERL_TR2001-03,
      • author = {Andrew Garland and Neal Lesh},
      • title = {Learning Hierarchical Task Models by Demonstration (subsumed by TR2002-04)},
      • institution = {MERL - Mitsubishi Electric Research Laboratories},
      • address = {Cambridge, MA 02139},
      • number = {TR2001-03},
      • month = jan,
      • year = 2001,
      • url = {}
      • }
  • Research Areas:

    Artificial Intelligence, Data Analytics


Most previous work on learning task models, a special case of the well-known knowledge acquisition bottleneck, has dealt with non-hierarchical models. We present and analyze techniques for inferring a hierarchical task model from partially-annotated examples of task-solving behavior. We show our algorithm has desirable formal properties and that both restrictive and preference biases are useful for generating effective models. Finally, we describe experiments that explore the appropriate division of labor between the learning algorithm and the person who provides the annotated examples.