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
A cost minimization approach to human behavior recognition
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Assessing the complexity of plan recognition
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
A hybrid plan recognition model for Alzheimer's patients: Interleaved-erroneous dilemma
Web Intelligence and Agent Systems
A plan classifier based on Chi-square distribution tests
Intelligent Data Analysis
Detection of suspicious behavior from a sparse set of multiagent interactions
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Curing robot autism: a challenge
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
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). While reasoning about such expected utilities is intractable in the general case, we present a hybrid symbolic/decision-theoretic plan recognizer, whose complexity is O(N DT), where N is the plan library size, D is the depth of the library and T is the number of observations. We demonstrate the efficacy of this approach with experimental results in several challenging recognition tasks.