Toward Combining Domain Theory and Recipes in Plan Recognition

Toward Combining Domain Theory and Recipes in Plan Recognition
复制标题

在计划识别中将领域理论和方法相结合

DOI:
--
复制
发表时间:
2017
期刊:
--
影响因子:
--
通讯作者:
R. Young
R. Young
中科院分区:
--
文献类型:
--
作者:
R. E. Cardona;R. Young

文献摘要

被引文献

相似文献

我们提出了一种技术,通过分解规划进一步缩小基于配方和基于领域理论的计划识别之间的差距,这是一种结合了分层任务网络中使用的分层推理和部分顺序因果联系规划中使用的最小承诺细化推理的规划模型。我们通过分解计划操作符表示食谱,并使用它们将观察到的代理动作编译成表示它们的不完整分解计划;然后可以将该计划输入到分解计划器中,以识别已识别的计划-空间计划。因此,我们的模型将迄今为止完全不同的基于配方和基于领域理论的计划识别变体综合为统一的知识表示和推理模型。
We present a technique to further narrow the gap between recipe-based and domain theory-based plan recognition through decompositional planning, a planning model that combines hierarchical reasoning as used in hierarchical task networks, and least-commitment refinement reasoning as used in partial-order causal link planning. We represent recipes through decompositional planning operators and use them to compile observed agent actions into an incomplete decompositional plan that represents them; this plan can then be input to a decompositional planner to identify the recognized plan-space plan. Our model thus synthesizes the heretofore disparate recipe-based and domain theory-based plan recognition variants into a unified knowledge representation and reasoning model.