Assessing the Complexity of Plan Recognition

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.

• Type: Conference
• Year: 2004
• Where: AAAI
• Authors: Christopher W. Geib
• Keywords: AAAI 2004, Intelligent Agents, Plan Library, Plan Recognition, Plan Recognition Algorithm