This paper presents a new approach for analyzing and identifying potentially useful generalized plans. It presents a new conceptual framework along with an algorithmic process for assessing termination and reachability related properties of generalized plans. The presented framework builds upon classic results on the analysis of graphs to decompose generalized plans into smaller components in a novel algorithm for conducting a hierarchical analysis for termination of arbitrary generalized plans. Theoretical analysis of the new framework establishes soundness of the presented algorithms and shows how it goes beyond existing approaches; empirical analysis illustrates the scope of this approach. Our analysis shows that this new approach can effectively identify termination for a significantly larger class of generalized plans than was possible using existing methods.
翻译:本文件介绍了分析和确定可能有用的通用计划的新办法,提出了评估通用计划的终止和可达性特性的新概念框架和算法进程,并借鉴了分析图表的经典结果,将通用计划分解成新的算法中的较小组成部分,以进行等级分析,终止任意的通用计划。对新框架的理论分析确定了所提出算法的正确性,并表明它如何超越了现有方法;实证分析说明了这一方法的范围。我们的分析表明,这一新方法可以有效地确定,对于比使用现有方法可能要大得多的通用计划类别而言,终止的终止。