在不确定性和时间限制下生成低成本计划

B. Baki, M. Bouzid, A. Ligeza
{"title":"在不确定性和时间限制下生成低成本计划","authors":"B. Baki, M. Bouzid, A. Ligeza","doi":"10.1109/ICTAI.2005.68","DOIUrl":null,"url":null,"abstract":"The paper describes a new approach to generating partially ordered plans with durative actions. Both cost and duration of any task is defined through probability distribution. We propose a planner that generates a plan represented in the form of a partially ordered set of tasks. Each task has a set of temporal constraints, a set of probabilities and a set of constant costs. The planning system generates admissible plans satisfying temporal constraints and allows to select the plan of lowest expected cost","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Generating low cost plans under uncertainty and temporal constraints\",\"authors\":\"B. Baki, M. Bouzid, A. Ligeza\",\"doi\":\"10.1109/ICTAI.2005.68\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper describes a new approach to generating partially ordered plans with durative actions. Both cost and duration of any task is defined through probability distribution. We propose a planner that generates a plan represented in the form of a partially ordered set of tasks. Each task has a set of temporal constraints, a set of probabilities and a set of constant costs. The planning system generates admissible plans satisfying temporal constraints and allows to select the plan of lowest expected cost\",\"PeriodicalId\":294694,\"journal\":{\"name\":\"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2005.68\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2005.68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文描述了一种生成具有持续动作的部分有序计划的新方法。任何任务的成本和持续时间都是通过概率分布来定义的。我们提出了一个计划器,它生成一个以部分有序任务集的形式表示的计划。每个任务都有一组时间限制、一组概率和一组恒定成本。规划系统生成满足时间约束的可接受方案,并允许选择期望成本最低的方案
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Generating low cost plans under uncertainty and temporal constraints
The paper describes a new approach to generating partially ordered plans with durative actions. Both cost and duration of any task is defined through probability distribution. We propose a planner that generates a plan represented in the form of a partially ordered set of tasks. Each task has a set of temporal constraints, a set of probabilities and a set of constant costs. The planning system generates admissible plans satisfying temporal constraints and allows to select the plan of lowest expected cost
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信