Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners

Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently, without the need of a plan library, using slightly modified planning algorithms. In this work, we extend this approach to the more general problem of probabilistic plan recognition where a probability distribution over the set of goals is sought under the assumptions that actions have deterministic effects and both agent and observer have complete information about the initial state. We show that this problem can be solved efficiently using classical planners provided that the probability of a partially observed execution given a goal is defined in terms of the cost difference of achieving the goal under two conditions: complying with the observations, and not complying with them. This cost, and hence the posterior goal probabilities, are computed by means of two calls to a classical planner that no longer has to be modified in any way. A number of examples is considered to illustrate the quality, flexibility, and scalability of the approach.

[1]  Pavol Návrat,et al.  Expressivity of STRIPS-Like and HTN-Like Planning , 2007, KES-AMSTA.

[2]  Judea Pearl,et al.  Qualitative Probabilities for Default Reasoning, Belief Revision, and Causal Modeling , 1996, Artif. Intell..

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

[4]  Nando de Freitas,et al.  Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks , 2000, UAI.

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

[6]  Malte Helmert,et al.  Landmarks Revisited , 2008, AAAI.

[7]  Craig A. Knoblock,et al.  Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.

[8]  R. Goldman,et al.  Requirements for Plan Recognition in Network Security Systems , 2003 .

[9]  Edmund H. Durfee,et al.  The Automated Mapping of Plans for Plan Recognition , 1994, AAAI.

[10]  Henry A. Kautz,et al.  Sensor-Based Understanding of Daily Life via Large-Scale Use of Common Sense , 2006, AAAI.

[11]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[12]  Wendy G. Lehnert,et al.  Strategies for Natural Language Processing , 1982 .

[13]  Hector Geffner,et al.  Plan Recognition as Planning , 2009, IJCAI.

[14]  Svetha Venkatesh,et al.  The Hidden Permutation Model and Location-Based Activity Recognition , 2008, AAAI.

[15]  Qiang Yang,et al.  Quantifying information and contradiction in propositional logic through test actions , 2009, IJCAI.

[16]  Chris L. Baker,et al.  Action understanding as inverse planning , 2009, Cognition.

[17]  Robert P. Goldman,et al.  A probabilistic plan recognition algorithm based on plan tree grammars , 2009, Artif. Intell..

[18]  C. Raymond Perrault,et al.  Beyond Question-Answering. , 1981 .

[19]  Oren Etzioni,et al.  A Sound and Fast Goal Recognizer , 1995, IJCAI.

[20]  James M. Rehg,et al.  A Scalable Approach to Activity Recognition based on Object Use , 2007, 2007 IEEE 11th International Conference on Computer Vision.