A Bayesian model of plan recognition
Artificial Intelligence
Heuristics for Planning with Action Costs Revisited
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Sensor-based understanding of daily life via large-scale use of common sense
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Fast and complete symbolic plan recognition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A sound and fast goal recognizer
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A new model of plan recognition
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Domain Independent Goal Recognition
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Managing implicit assumptions in natural language interfaces
Proceedings of the 2012 ACM international conference on Intelligent User Interfaces
Multi-agent plan recognition with partial team traces and plan libraries
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Goal recognition over POMDPs: inferring the intention of a POMDP agent
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Plan recognition by program execution in continuous temporal domains
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
Prognostic normative reasoning
Engineering Applications of Artificial Intelligence
Robotics and artificial intelligence: A perspective on deliberation functions
AI Communications - ECAI 2012 Turing and Anniversary Track
| Hi-index | 0.00 |
In this work we aim to narrow the gap between plan recognition and planning by exploiting the power and generality of recent planning algorithms for recognizing the set G* of goals G that explain a sequence of observations given a domain theory. After providing a crisp definition of this set, we show by means of a suitable problem transformation that a goal G belongs to G* if there is an action sequence π that is an optimal plan for both the goal G and the goal G extended with extra goals representing the observations. Exploiting this result, we show how the set G* can be computed exactly and approximately by minor modifications of existing optimal and suboptimal planning algorithms, and existing polynomial heuristics. Experiments over several domains show that the suboptimal planning algorithms and the polynomial heuristics provide good approximations of the optimal goal set G* while scaling up as well as state-of-the-art planning algorithms and heuristics.