arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.0559cs.AI
收藏

连续时间和资源不确定性下的规划:对AI的挑战

Planning under Continuous Time and Resource Uncertainty: A Challenge for AI

NASA Ames Research Center(美国国家航空航天局艾姆斯研究中心);QSS Group Inc.(QSS集团公司)

John Bresina, Richard Dearden, Nicolas Meuleau, Sailesh Ramkrishnan, David Smith, Richard Washington

摘要:

我们概述了一类问题,典型的火星漫游者的操作,是有问题的,目前的规划方法下的不确定性。现有的方法失败,因为他们遭受一个或多个以下限制:1)他们依赖于非常简单的行动和时间模型,2)他们假设不确定性表现在离散的行动结果,3)他们只适用于非常小的问题。对于许多现实世界的问题,这些假设并不成立。特别是,当计划火星漫游者的活动时,上述假设都是无效的:1)动作可以是并发的,并且具有不同的持续时间,2)关于动作持续时间和连续资源(如电力)的消耗存在不确定性,以及3)典型的日常计划涉及大约一百个动作。这类问题可能是特别感兴趣的UAI社区,因为经典的和决策理论的规划技术可能是有用的,在解决it.We描述的流动站问题,讨论以前的工作规划下的不确定性,并提出了一个详细的,但非常小的例子说明了一些困难,找到好的计划。

英文摘要:

We outline a class of problems, typical of Mars rover operations, that are problematic for current methods of planning under uncertainty. The existing methods fail because they suffer from one or more of the following limitations: 1) they rely on very simple models of actions and time, 2) they assume that uncertainty is manifested in discrete action outcomes, 3) they are only practical for very small problems. For many real world problems, these assumptions fail to hold. In particular, when planning the activities for a Mars rover, none of the above assumptions is valid: 1) actions can be concurrent and have differing durations, 2) there is uncertainty concerning action durations and consumption of continuous resources like power, and 3) typical daily plans involve on the order of a hundred actions. This class of problems may be of particular interest to the UAI community because both classical and decision-theoretic planning techniques may be useful in solving it. We describe the rover problem, discuss previous work on planning under uncertainty, and present a detailed, but very small, example illustrating some of the difficulties of finding good plans.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑