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

学习安全的数值规划动作模型

Learning Safe Numeric Planning Action Models

Software and Information Systems Engineering, Ben-Gurion University of the Negev(本·古里安大学软件与信息系统工程系);Department of Computer Science and Engineering, Washington University(华盛顿大学计算机科学与工程系)

Argaman Mordoch, Shahaf S. Shperberg, Roni Stern, Berndan Juba

AI总结:

本文提出N-SAM及N-SAM*算法,用于学习安全的数值规划动作模型,在保证安全性的前提下扩展了动作适用性,并在样本复杂度上达到最优。

摘要:

将规划技术应用于现实世界问题的一个重大挑战在于获取一个能准确表示问题动态特性的规划模型。在关键任务领域中,获取规划模型更具挑战性,因为通过试错方法来学习如何行动是不可行的。在这些领域中,用于生成规划的动作模型必须是安全的,即使用该模型生成的规划必须是可执行的并能实现其目标。学习安全的规划动作模型主要在状态可以通过布尔变量充分描述的领域中被探索。在这项工作中,我们超越了这一限制,提出了数值安全动作模型学习(N-SAM)算法。我们提出了N-SAM,这是一种动作模型学习算法,能够学习安全的数值前提条件和效果。我们证明N-SAM在观察数量上的运行时间是线性的,并且在特定条件下,保证返回安全的动作模型。然而,为了保持这种安全保证,N-SAM必须在将每个动作纳入学习模型之前观察到该动作的大量示例。我们解决了N-SAM的这一局限性,并提出了N-SAM*,这是N-SAM算法的扩展,它始终返回一个动作模型,其中每个观察到的动作至少在某些状态下是可执行的,即使该动作仅被观察到一次。N-SAM*在不损害返回动作模型安全性的前提下做到了这一点。我们证明,与任何其他保证安全性的算法相比,N-SAM*在样本复杂度方面是最优的。N-SAM和N-SAM*在广泛的数值规划领域基准上进行了评估,其性能与最先进的数值动作模型学习算法进行了比较。我们还讨论了数值精度对学习过程的影响。

英文摘要:

A significant challenge in applying planning technology to real-world problems lies in obtaining a planning model that accurately represents the problem's dynamics. Obtaining a planning model is even more challenging in mission-critical domains, where a trial-and-error approach to learning how to act is not an option. In such domains, the action model used to generate plans must be safe, in the sense that plans generated with it must be applicable and achieve their goals. % Learning safe action models for planning has been mostly explored for domains in which states are sufficiently described with Boolean variables. % In this work, we go beyond this limitation and propose the Numeric Safe Action Models Learning (N-SAM) algorithm. In this work, we present N-SAM, an action model learning algorithm capable of learning safe numeric preconditions and effects. We prove that N-SAM runs in linear time in the number of observations and, under certain conditions, is guaranteed to return safe action models. However, to preserve this safety guarantee, N-SAM must observe a substantial number of examples for each action before including it in the learned model. We address this limitation of N-SAM and propose N-SAM*, an extension to the N-SAM algorithm that always returns an action model where every observed action is applicable at least in some states, even if it was observed only once. N-SAM* does so without compromising the safety of the returned action model. We prove that N-SAM* is optimal in terms of sample complexity compared to any other algorithm that guarantees safety. N-SAM and N-SAM* are evaluated over an extensive benchmark of numeric planning domains, and their performance is compared to a state-of-the-art numeric action model learning algorithm. We also provide a discussion on the impact of numerical accuracy on the learning process.

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

↑