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

面向泛化规划的层次化分解与分析

Hierarchical Decomposition and Analysis for Generalized Planning

School of Computing and Augmented Intelligence(计算与增强智能学院);Arizona State University(亚利桑那州立大学)

Siddharth Srivastava

AI总结:

本文提出了一种基于图论分解泛化规划的新概念框架和算法,用于评估其终止性和目标可达性,显著扩展了可自动评估的泛化规划类别,并指导其合成与学习。

摘要:

本文提出了分析和评估泛化规划的新方法,这些泛化规划能够解决广泛类别的相关规划问题。尽管泛化规划的合成与学习一直是AI的长期目标,但由于在分析给定泛化规划的范围和效用的方法上存在根本性差距,这仍然具有挑战性。本文通过开发一个新的概念框架以及证明技术和算法过程,来评估泛化规划的终止和目标可达性相关属性,从而填补了这些差距。我们基于图论的经典结果,将泛化规划分解为更小的组件,然后利用这些组件推导层次化终止论证。这些方法可用于确定给定泛化规划的效用,以及指导泛化规划的合成与学习过程。我们展示了说明这种新方法范围的理论和实证结果。我们的分析表明,该方法显著扩展了可自动评估的泛化规划类别,从而减少了合成和学习可靠泛化规划的障碍。

英文摘要:

This paper presents new methods for analyzing and evaluating generalized plans that can solve broad classes of related planning problems. Although synthesis and learning of generalized plans has been a longstanding goal in AI, it remains challenging due to fundamental gaps in methods for analyzing the scope and utility of a given generalized plan. This paper addresses these gaps by developing a new conceptual framework along with proof techniques and algorithmic processes for assessing termination and goal-reachability related properties of generalized plans. We build upon classic results from graph theory to decompose generalized plans into smaller components that are then used to derive hierarchical termination arguments. These methods can be used to determine the utility of a given generalized plan, as well as to guide the synthesis and learning processes for generalized plans. We present theoretical as well as empirical results illustrating the scope of this new approach. Our analysis shows that this approach significantly extends the class of generalized plans that can be assessed automatically, thereby reducing barriers in the synthesis and learning of reliable generalized plans.

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

↑