论文信息 - Assessing the Complexity of Plan Recognition

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.

Christopher W. Geib | C. Geib

[1] Robert P. Goldman,et al. A New Model of Plan Recognition , 1999, UAI.

[2] Robert P. Goldman,et al. Probabilistic Plan Recognition for Hostile Agents , 2001, FLAIRS Conference.

[3] James A. Hendler,et al. UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning , 1994, AIPS.

[4] Robert P. Goldman,et al. A Bayesian Model of Plan Recognition , 1993, Artif. Intell..

[5] Michael P. Wellman,et al. Probabilistic State-Dependent Grammars for Plan Recognition , 2000, UAI.

[6] Robert P. Goldman,et al. Plan recognition in intrusion detection systems , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.

[7] James A. Hendler,et al. HTN Planning: Complexity and Expressivity , 1994, AAAI.

[8] Hung Hai Bui,et al. A General Model for Online Probabilistic Plan Recognition , 2003, IJCAI.

[9] Kenneth P. Bogart,et al. Introductory Combinatorics , 1977 .

[10] Henry A. Kautz,et al. Generalized Plan Recognition , 1986, AAAI.

[11] Robert P. Goldman,et al. Recognizing Plan/Goal Abandonment , 2003, IJCAI.

[12] David Poole,et al. The Independent Choice Logic for Modelling Multiple Agents Under Uncertainty , 1997, Artif. Intell..

[13] Eric Horvitz,et al. The Lumière Project: Bayesian User Modeling for Inferring the Goals and Needs of Software Users , 1998, UAI.