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

规划光谱-一,二,三,无限

The Planning Spectrum - One, Two, Three, Infinity

University of Trento(特伦托大学);Rice University(莱斯大学)

M. Pistore, M. Y. Vardi

摘要:

线性时态逻辑(LTL)被广泛用于定义动态系统执行路径上的条件。在允许非确定性演化的动态系统的情况下,我们必须指定满足LTL公式f的路径。两种极端情况是普遍解释A.f和存在解释E.f,前者要求公式对所有执行路径都满足,后者要求公式对某条执行路径都满足.当LTL应用于不确定域规划问题的目标定义时,这两种极端情况限制太多.在系统的所有非确定性演化中,通常不可能制定出实现目标的计划,并且要求通过某些执行来满足目标也太弱了。在本文中,我们将探讨这些极端情况之间的LTL公式的替代解释。我们定义了一种新的语言,它允许A和E量词的任意组合,从而允许,例如,要求每个有限执行可以扩展到满足LTL公式(AE.f)的执行,或者有一些有限执行的扩展都满足LTL公式(EA.f)。我们发现,只有八个这些组合的路径量词是相关的,对应于交替的量词的长度为1(A和E),2(AE和EA),3(AEA和EAE),和无穷大((AE)* 和(EA)*)。我们还提出了一个新的语言,是基于自动机理论的方法的规划算法,并研究其复杂性。

英文摘要:

Linear Temporal Logic (LTL) is widely used for defining conditions on the execution paths of dynamic systems. In the case of dynamic systems that allow for nondeterministic evolutions, one has to specify, along with an LTL formula f, which are the paths that are required to satisfy the formula. Two extreme cases are the universal interpretation A.f, which requires that the formula be satisfied for all execution paths, and the existential interpretation E.f, which requires that the formula be satisfied for some execution path. When LTL is applied to the definition of goals in planning problems on nondeterministic domains, these two extreme cases are too restrictive. It is often impossible to develop plans that achieve the goal in all the nondeterministic evolutions of a system, and it is too weak to require that the goal is satisfied by some execution. In this paper we explore alternative interpretations of an LTL formula that are between these extreme cases. We define a new language that permits an arbitrary combination of the A and E quantifiers, thus allowing, for instance, to require that each finite execution can be extended to an execution satisfying an LTL formula (AE.f), or that there is some finite execution whose extensions all satisfy an LTL formula (EA.f). We show that only eight of these combinations of path quantifiers are relevant, corresponding to an alternation of the quantifiers of length one (A and E), two (AE and EA), three (AEA and EAE), and infinity ((AE)* and (EA)*). We also present a planning algorithm for the new language that is based on an automata-theoretic approach, and study its complexity.

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

↑