通过约束表达性规划

Uwe Köckemann, F. Pecora, L. Karlsson
{"title":"通过约束表达性规划","authors":"Uwe Köckemann, F. Pecora, L. Karlsson","doi":"10.3233/978-1-61499-330-8-155","DOIUrl":null,"url":null,"abstract":"The real-world applicability of automated planners depends on the expressiveness of the problem modeling language. Contemporary planners can deal with causal features of the problem, but only limited forms of temporal, resource and relational constraints. These constraints should be fully supported for dealing with real-world applications. We propose a highly-expressive, action-based planning language which includes causal, relational, temporal and resource constraints. This paper also contributes an approach for solving such rich planning problems by decomposition and constraint reasoning. The approach is general with respect to the types of constraints used in the problem definition language, in that additional solvers need only satisfy certain formal properties. The approach is evaluated on a domain which utilizes many features offered by the introduced language.","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Expressive Planning Through Constraints\",\"authors\":\"Uwe Köckemann, F. Pecora, L. Karlsson\",\"doi\":\"10.3233/978-1-61499-330-8-155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The real-world applicability of automated planners depends on the expressiveness of the problem modeling language. Contemporary planners can deal with causal features of the problem, but only limited forms of temporal, resource and relational constraints. These constraints should be fully supported for dealing with real-world applications. We propose a highly-expressive, action-based planning language which includes causal, relational, temporal and resource constraints. This paper also contributes an approach for solving such rich planning problems by decomposition and constraint reasoning. The approach is general with respect to the types of constraints used in the problem definition language, in that additional solvers need only satisfy certain formal properties. The approach is evaluated on a domain which utilizes many features offered by the introduced language.\",\"PeriodicalId\":322432,\"journal\":{\"name\":\"Scandinavian Conference on AI\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scandinavian Conference on AI\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/978-1-61499-330-8-155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scandinavian Conference on AI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-61499-330-8-155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

自动化计划器在现实世界中的适用性取决于问题建模语言的表达能力。当代规划师可以处理问题的因果特征,但只能处理有限形式的时间、资源和关系约束。在处理实际应用程序时,应该完全支持这些约束。我们提出了一种高度表达的、基于行动的规划语言,它包括因果、关系、时间和资源约束。本文还提出了一种利用分解和约束推理求解这类丰富规划问题的方法。对于问题定义语言中使用的约束类型,该方法是通用的,因为附加的求解器只需要满足某些形式属性。该方法在一个利用引入语言提供的许多特性的领域上进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Expressive Planning Through Constraints
The real-world applicability of automated planners depends on the expressiveness of the problem modeling language. Contemporary planners can deal with causal features of the problem, but only limited forms of temporal, resource and relational constraints. These constraints should be fully supported for dealing with real-world applications. We propose a highly-expressive, action-based planning language which includes causal, relational, temporal and resource constraints. This paper also contributes an approach for solving such rich planning problems by decomposition and constraint reasoning. The approach is general with respect to the types of constraints used in the problem definition language, in that additional solvers need only satisfy certain formal properties. The approach is evaluated on a domain which utilizes many features offered by the introduced language.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Goal-driven, assistive agents for instructing and guiding user activities On Associative Confounder Bias Heuristics for Determining the Elimination Ordering in the Influence Diagram Evaluation with Binary Trees Revisiting Inner Entanglements in Classical Planning Error AMP Chain Graphs
×
引用
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