On Partial Satisfaction Planning with Total-Order HTNs

G. Behnke, David Speck, Michael Katz, Shirin Sohrabi
{"title":"On Partial Satisfaction Planning with Total-Order HTNs","authors":"G. Behnke, David Speck, Michael Katz, Shirin Sohrabi","doi":"10.1609/icaps.v33i1.27177","DOIUrl":null,"url":null,"abstract":"Since its introduction, partial satisfaction planning (PSP), including both oversubscription (OSP) and net-benefit, has received significant attention in the classical planning community. \nHowever, hierarchical aspects have been mostly ignored in this context, although several problem domains that form the main motivation for PSP, such as the rover domain, have an inherent hierarchical structure.\nIn this paper, we are taking the necessary steps for facilitating this research direction.\nFirst, we formally define hierarchical partial satisfaction planning problems and discuss the usefulness and necessity of this formalism. \nSecond, we present a carefully structured set of benchmarks consisting of OSP and net-benefit problems with hierarchical structure.\nWe describe and analyze the different domains of the benchmark set and the desiderata that are met to provide an interesting and challenging starting point for upcoming research.\nThird, we introduce various planning techniques that can solve hierarchical OSP problems and investigate their empirical behaviour on our proposed benchmark.","PeriodicalId":239898,"journal":{"name":"International Conference on Automated Planning and Scheduling","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Automated Planning and Scheduling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/icaps.v33i1.27177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Since its introduction, partial satisfaction planning (PSP), including both oversubscription (OSP) and net-benefit, has received significant attention in the classical planning community. However, hierarchical aspects have been mostly ignored in this context, although several problem domains that form the main motivation for PSP, such as the rover domain, have an inherent hierarchical structure. In this paper, we are taking the necessary steps for facilitating this research direction. First, we formally define hierarchical partial satisfaction planning problems and discuss the usefulness and necessity of this formalism. Second, we present a carefully structured set of benchmarks consisting of OSP and net-benefit problems with hierarchical structure. We describe and analyze the different domains of the benchmark set and the desiderata that are met to provide an interesting and challenging starting point for upcoming research. Third, we introduce various planning techniques that can solve hierarchical OSP problems and investigate their empirical behaviour on our proposed benchmark.
全阶htn的部分满足规划
自提出以来,部分满意度规划(PSP),包括超额认购(OSP)和净收益(net-benefit),在传统规划界受到了极大的关注。然而,在这种情况下,层次结构方面大多被忽略了,尽管构成PSP主要动机的几个问题领域,如漫游者领域,具有固有的层次结构。在本文中,我们正在采取必要的步骤来促进这一研究方向。首先,我们正式定义了层次部分满足规划问题,并讨论了这种形式的有用性和必要性。其次,我们提出了一套精心构建的基准,包括OSP和具有分层结构的净效益问题。我们描述和分析基准集的不同领域以及满足的需求,为即将进行的研究提供一个有趣且具有挑战性的起点。第三,我们介绍了各种可以解决分层OSP问题的规划技术,并在我们提出的基准上研究它们的经验行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信