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

学习对存在量化目标进行实例化

Learning to Ground Existentially Quantified Goals

Linköping University(林雪平大学);RWTH Aachen University(亚琛工业大学)

Martin Funkquist, Simon Ståhlberg, Hector Geffner

AI总结:

本文提出用监督学习和GNN架构解决目标实例化问题,通过在小规模实例上训练预测部分量化目标代价,并在更大实例上验证其跨目标变量数和对象数的泛化能力。

摘要:

自主AI智能体的目标指令不能假设对象具有唯一名称。相反,目标中的对象必须通过提供合适的描述来指称。然而,这在经典规划和广义规划中都引发了问题。在经典规划中处理存在量化目标的标准方法是将它们编译成一个DNF公式,该公式编码所有可能的变量绑定,并添加虚拟动作以将每个DNF项映射到新的虚拟目标。这种预处理在变量数量上是指数级的。在广义规划中,问题则不同:即使通用策略能够处理任何初始情况和目标,执行通用策略也需要将目标实例化,以便为策略特征定义值。目标实例化问题,即找到绑定目标变量的对象,是非常微妙的:它是经典规划的推广——当没有目标变量需要绑定时,经典规划是其特例;它也是约束推理的推广——当没有动作时,约束推理是其特例。在这项工作中,我们以一种新颖的监督学习方法来处理目标实例化问题。一个GNN架构被训练用于预测小型领域实例上部分量化目标的代价,并在涉及更多对象和不同量化目标的较大实例上进行测试。所提出的架构在多个规划领域上进行了实验评估,其中泛化能力沿着多个维度进行测试,包括目标变量的数量以及能够绑定这些变量的对象的数量。鉴于GNN与C2逻辑之间的已知关系,本文还讨论了该方法的适用范围。

英文摘要:

Goal instructions for autonomous AI agents cannot assume that objects have unique names. Instead, objects in goals must be referred to by providing suitable descriptions. However, this raises problems in both classical planning and generalized planning. The standard approach to handling existentially quantified goals in classical planning involves compiling them into a DNF formula that encodes all possible variable bindings and adding dummy actions to map each DNF term into the new, dummy goal. This preprocessing is exponential in the number of variables. In generalized planning, the problem is different: even if general policies can deal with any initial situation and goal, executing a general policy requires the goal to be grounded to define a value for the policy features. The problem of grounding goals, namely finding the objects to bind the goal variables, is subtle: it is a generalization of classical planning, which is a special case when there are no goal variables to bind, and constraint reasoning, which is a special case when there are no actions. In this work, we address the goal grounding problem with a novel supervised learning approach. A GNN architecture, trained to predict the cost of partially quantified goals over small domain instances is tested on larger instances involving more objects and different quantified goals. The proposed architecture is evaluated experimentally over several planning domains where generalization is tested along several dimensions including the number of goal variables and objects that can bind such variables. The scope of the approach is also discussed in light of the known relationship between GNNs and C2 logics.

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

↑