A Bayesian model of plan recognition
Artificial Intelligence
The Hierarchical Hidden Markov Model: Analysis and Applications
Machine Learning
Activity Recognition and Abnormality Detection with the Switching Hidden Semi-Markov Model
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
RESC: an approach for real-time, dynamic agent tracking
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Fast and complete symbolic plan recognition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Flexible Multi-Agent Decision Making Under Time Pressure
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
Plan recognition is the process of inferring other agents' plans and goals based on their observable actions. Essentially all previous work in plan recognition has focused on the recognition process itself, with no regard to the use of the information in the recognizing agent. As a result, low-likelihood recognition hypotheses that may imply significant meaning to the observer, are ignored in existing work. In this paper, we present novel efficient algorithms that allows the observer to incorporate her own biases and preferences---in the form of a utility function---into the plan recognition process. This allows choosing recognition hypotheses based on their expected utility to the observer. We call this Utility-based Plan Recognition (UPR). We briefly discuss a hybrid symbolic decision-theoretic plan recognizer, and demonstrate the efficacy of this approach in an example.