Determining Representativeness of Training Plans: A Case of Macro-Operators

L. Chrpa, M. Vallati
{"title":"Determining Representativeness of Training Plans: A Case of Macro-Operators","authors":"L. Chrpa, M. Vallati","doi":"10.1109/ICTAI.2018.00081","DOIUrl":null,"url":null,"abstract":"Most learning for planning approaches rely on analysis of training plans. This is especially the case for one of the best-known learning approach: the generation of macro-operators (macros). These plans, usually generated from a very limited set of training tasks, must provide a ground to extract useful knowledge that can be fruitfully exploited by planning engines. In that, training tasks have to be representative of the larger class of planning tasks on which planning engines will then be run. A pivotal question is how such a set of training tasks can be selected. To address this question, here we introduce a notion of structural similarity of plans. We conjecture that if a class of planning tasks presents structurally similar plans, then a small subset of these tasks is representative enough to learn the same knowledge (macros) as could be learnt from a larger set of tasks of the same class. We have tested our conjecture by focusing on two state-of-the-art macro generation approaches. Our large empirical analysis considering seven state-of-the-art planners, and fourteen benchmark domains from the International Planning Competition, generally confirms our conjecture which can be exploited for selecting small-yet-informative training sets of tasks.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2018.00081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Most learning for planning approaches rely on analysis of training plans. This is especially the case for one of the best-known learning approach: the generation of macro-operators (macros). These plans, usually generated from a very limited set of training tasks, must provide a ground to extract useful knowledge that can be fruitfully exploited by planning engines. In that, training tasks have to be representative of the larger class of planning tasks on which planning engines will then be run. A pivotal question is how such a set of training tasks can be selected. To address this question, here we introduce a notion of structural similarity of plans. We conjecture that if a class of planning tasks presents structurally similar plans, then a small subset of these tasks is representative enough to learn the same knowledge (macros) as could be learnt from a larger set of tasks of the same class. We have tested our conjecture by focusing on two state-of-the-art macro generation approaches. Our large empirical analysis considering seven state-of-the-art planners, and fourteen benchmark domains from the International Planning Competition, generally confirms our conjecture which can be exploited for selecting small-yet-informative training sets of tasks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
培训计划代表性的确定:以宏观算子为例
大多数规划方法的学习依赖于对培训计划的分析。对于最著名的学习方法之一来说尤其如此:生成宏操作符(macrooperators,宏)。这些计划通常是由一组非常有限的训练任务生成的,必须提供一个基础来提取有用的知识,这些知识可以被计划引擎有效地利用。在这种情况下,训练任务必须代表更大类别的计划任务,然后在这些任务上运行计划引擎。一个关键的问题是如何选择这样一组训练任务。为了解决这个问题,我们在这里引入一个平面结构相似性的概念。我们推测,如果一类规划任务呈现结构相似的计划,那么这些任务的一小部分就足以代表从同一类的更大的任务集中学习到相同的知识(宏)。我们通过关注两种最先进的宏生成方法来测试我们的猜想。我们的大型实证分析考虑了七个最先进的规划者,以及来自国际规划竞赛的14个基准领域,总体上证实了我们的猜想,可以用于选择小而信息量大的任务训练集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
[Title page i] Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers Effective Ant Colony Optimization Solution for the Brazilian Family Health Team Scheduling Problem Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1