.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Plan recognition
Bayesian methods
Probabilistic grammars
Task tracking
Intent inference
Goal recognition
Action grammars
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
Control of pheromone quantity in odor trails of the antAcanthomyops interjectus MAYR.png)
Experientia
ExperientiaIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
ShareSave
View more