.png){kind=icon}
返回
A probabilistic plan recognition algorithm based on plan tree grammars
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2009.01.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present the PHATT algorithm for plan recognition. Unlike previous approaches to plan recognition, PHATT is based on a model of plan execution. We show that this clarifies several difficult issues in plan recognition including the execution of multiple interleaved root goals, partially ordered plans, and failing to observe actions. We present the PHATT algorithm's theoretical basis, and an implementation based on tree structures. We also investigate the algorithm's complexity, both analytically and empirically. Finally, we present PHATT's integrated constraint reasoning for parametrized actions and temporal constraints. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Plan recognition
Bayesian methods
Probabilistic grammars
Task tracking
Intent inference
Goal recognition
Action grammars
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
Control of pheromone quantity in odor trails of the antAcanthomyops interjectus MAYR.png)
Experientia
ExperientiaIF0
PREAI
分享收藏分享收藏Extracting places and activities from GPS traces using hierarchical conditional random fields使用分层条件随机场从GPS轨迹中提取地点和活动
PREAI
分享收藏
查看更多内容