Leveraging Demonstrations for Learning the Structure and Parameters of Hierarchical Task Networks

Philippe Hérail, Arthur Bit-Monnot
{"title":"Leveraging Demonstrations for Learning the Structure and Parameters of Hierarchical Task Networks","authors":"Philippe Hérail, Arthur Bit-Monnot","doi":"10.32473/flairs.36.133327","DOIUrl":null,"url":null,"abstract":"\nHierarchical Task Networks (HTNs) are a common formalism for automated planning, allowing to leverage the hierarchical structure of many activities. \nWhile HTNs have been used in many practical applications, building a complete and efficient HTN model remains a difficult and mostly manual task. \n \nIn this paper, we present an algorithm for learning such hierarchical models from a set of demonstrations. \nGiven an initial vocabulary of tasks and accompanying demonstrations of possible ways to achieve them, we present how each task can be associated with a set of methods capturing the knowledge of how to achieve it. \nWe focus on the algorithms used to learn the structure of the model and to efficiently parameterize it, as well as an evaluation in terms of planning performance. \n","PeriodicalId":302103,"journal":{"name":"The International FLAIRS Conference Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The International FLAIRS Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32473/flairs.36.133327","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Hierarchical Task Networks (HTNs) are a common formalism for automated planning, allowing to leverage the hierarchical structure of many activities. While HTNs have been used in many practical applications, building a complete and efficient HTN model remains a difficult and mostly manual task. In this paper, we present an algorithm for learning such hierarchical models from a set of demonstrations. Given an initial vocabulary of tasks and accompanying demonstrations of possible ways to achieve them, we present how each task can be associated with a set of methods capturing the knowledge of how to achieve it. We focus on the algorithms used to learn the structure of the model and to efficiently parameterize it, as well as an evaluation in terms of planning performance.
利用演示学习分层任务网络的结构和参数
分层任务网络(HTNs)是自动化规划的常见形式,允许利用许多活动的分层结构。虽然HTN在许多实际应用中得到了应用,但构建一个完整、高效的HTN模型仍然是一项困难的、主要是手工的任务。在本文中,我们从一组演示中提出了一种学习这种分层模型的算法。给定任务的初始词汇表和伴随的实现它们的可能方法的演示,我们展示了如何将每个任务与一组获取如何实现它的知识的方法相关联。我们重点关注用于学习模型结构和有效参数化模型的算法,以及规划性能方面的评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信