arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1212.2502cs.AI
收藏

最优有限应急计划

Optimal Limited Contingency Planning

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

Nicolas Meuleau, David Smith

摘要:

对于一个给定的问题,最优马尔可夫策略可以被定义为包含(可能很大)数量分支的条件或偶然计划。不幸的是,在某些应用中,需要严格限制计划中决策点和分支的数量。例如,可能计划必须在以后进行更详细的模拟,以验证正确性和安全性,或者它们必须足够简单,以便人类理解和分析。因此,可能有必要将考虑范围限制在只有少量分支的计划上。这就提出了一个问题,即如何找到只包含有限数量分支的最优计划。本文提出了一种任意时刻的最优k-应急规划算法。它是有限应急计划的第一个最优算法,不是一个明确的枚举可能的应急计划。通过将问题建模为部分可观测的马尔可夫决策过程,它实现了贝尔曼最优性原则并修剪了解空间。我们提出了一些简单的测试用例应用该算法的实验结果。

英文摘要:

For a given problem, the optimal Markov policy can be considerred as a conditional or contingent plan containing a (potentially large) number of branches. Unfortunately, there are applications where it is desirable to strictly limit the number of decision points and branches in a plan. For example, it may be that plans must later undergo more detailed simulation to verify correctness and safety, or that they must be simple enough to be understood and analyzed by humans. As a result, it may be necessary to limit consideration to plans with only a small number of branches. This raises the question of how one goes about finding optimal plans containing only a limited number of branches. In this paper, we present an any-time algorithm for optimal k-contingency planning (OKP). It is the first optimal algorithm for limited contingency planning that is not an explicit enumeration of possible contingent plans. By modelling the problem as a Partially Observable Markov Decision Process, it implements the Bellman optimality principle and prunes the solution space. We present experimental results of applying this algorithm to some simple test cases.

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

↑