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

在线动作识别

Online Action Recognition

Universitat Pompeu Fabra(庞培法布拉大学)

Alejandro Suárez-Hernández, Javier Segovia-Aguas, Carme Torras, Guillem Alenyà

摘要:

规划中的识别试图在给定一组观察和知识库(例如目标状态,计划或域理论)的情况下找到代理意图,目标或活动。在这项工作中,我们介绍了在线动作识别的问题。它包括在承认,在一个开放的世界中,规划行动,最好地解释了部分可观察的状态从一阶ARIPS行动,这是最初的空知识库的过渡。我们将其视为一个优化问题,并提出了两种算法来解决它:动作统一(AU)和在线动作识别通过统一(OARU)。前者建立在逻辑统一的基础上,并使用加权部分MaxSAT将两个输入动作推广。后者在库中寻找解释观察到的转换的动作。如果有这样的动作,它会利用AU来推广它,以这种方式构建AU层次结构。否则,OARU会在库中插入一个简单的接地动作(TGA)来解释这个转换。我们报告的结果基准从国际规划竞赛和PDDLGym,OARU承认行动准确地尊重专家知识,并显示实时性能。

英文摘要:

Recognition in planning seeks to find agent intentions, goals or activities given a set of observations and a knowledge library (e.g. goal states, plans or domain theories). In this work we introduce the problem of Online Action Recognition. It consists in recognizing, in an open world, the planning action that best explains a partially observable state transition from a knowledge library of first-order STRIPS actions, which is initially empty. We frame this as an optimization problem, and propose two algorithms to address it: Action Unification (AU) and Online Action Recognition through Unification (OARU). The former builds on logic unification and generalizes two input actions using weighted partial MaxSAT. The latter looks for an action within the library that explains an observed transition. If there is such action, it generalizes it making use of AU, building in this way an AU hierarchy. Otherwise, OARU inserts a Trivial Grounded Action (TGA) in the library that explains just that transition. We report results on benchmarks from the International Planning Competition and PDDLGym, where OARU recognizes actions accurately with respect to expert knowledge, and shows real-time performance.

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

↑