arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1703.01083cs.AI
收藏

顺序计划识别

Sequential Plan Recognition

Ben-Gurion University of the Negev(内盖夫本-古里安大学)

Reuth Mirsky, Roni Stern, Ya'akov, Gal, Meir Kalech

摘要:

计划识别算法从他们观察到的动作中推断代理的计划。由于对智能体行为和环境的不完全了解,通常情况下,关于智能体的计划有多个假设与观察结果一致,尽管这些假设中只有一个是正确的。本文讨论了如何消除假设之间的歧义的问题,通过询问代理的候选计划是否在一个假设匹配其意图。这个过程是顺序执行的,并用于在识别过程中更新可能的假设集。本文定义了顺序计划识别过程(SPRP),旨在减少使用最少数量的查询的假设的数量。我们提出了一些政策的SPRP使用最大似然和信息增益来选择查询计划。我们表明,这种方法在实践中很好地工作在两个领域的文献,显着减少了假设的数量,使用更少的查询比基线的方法。我们的研究结果可以告知未来的计划识别系统的设计,交错的识别过程与智能干预的用户。

英文摘要:

Plan recognition algorithms infer agents' plans from their observed actions. Due to imperfect knowledge about the agent's behavior and the environment, it is often the case that there are multiple hypotheses about an agent's plans that are consistent with the observations, though only one of these hypotheses is correct. This paper addresses the problem of how to disambiguate between hypotheses, by querying the acting agent about whether a candidate plan in one of the hypotheses matches its intentions. This process is performed sequentially and used to update the set of possible hypotheses during the recognition process. The paper defines the sequential plan recognition process (SPRP), which seeks to reduce the number of hypotheses using a minimal number of queries. We propose a number of policies for the SPRP which use maximum likelihood and information gain to choose which plan to query. We show this approach works well in practice on two domains from the literature, significantly reducing the number of hypotheses using fewer queries than a baseline approach. Our results can inform the design of future plan recognition systems that interleave the recognition process with intelligent interventions of their users.

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

↑