Assessing the Complexity of Plan Recognition

@inproceedings{Geib2004AssessingTC,
  title={Assessing the Complexity of Plan Recognition},
  author={Christopher W. Geib},
  booktitle={AAAI},
  year={2004}
}
This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition algorithm must consider given various properties of the plan library. On the basis of these results it points out properties of plan libraries that make them computationally expensive. Introduction Plan recognition is a well studied problem in the Artificial Intelligence literature. Following others, we distinguish… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS
30 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

Similar Papers

Loading similar papers…