The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Murphy, K., & Russell, S. (2001) · Sequential Monte Carlo Methods in Practice · doi:10.1007/978-1-4757-3437-9_24 · Cited by 1,157
Action understanding as inverse planning
Baker, C. L., Saxe, R., & Tenenbaum, J. B. (2009) · Cognition · doi:10.1016/j.cognition.2009.07.005 · Cited by 920
Strategies for Natural Language Processing
(2014) · Psychology Press eBooks · doi:10.4324/9781315802671 · Cited by 517
Kautz, H., & Allen, J. F. (1986) · National Conference on Artificial Intelligence · Cited by 468
Unifying SAT-based and graph-based planning
Kautz, H., & Selman, B. (1999) · Cited by 429
Ramírez, M., & Geffner, H. (2009) · RMIT Research Repository (RMIT University Library) · Cited by 374
Self-citationA Scalable Approach to Activity Recognition based on Object Use
Wu, J., Osuntogun, A., Choudhury, T., Philipose, M., & Rehg, J. M. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408865 · Cited by 324
Qualitative probabilities for default reasoning, belief revision, and causal modeling
Goldszmidt, M., & Pearl, J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00090-9 · Cited by 321
A probabilistic plan recognition algorithm based on plan tree grammars
Geib, C. W., & Goldman, R. P. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2009.01.003 · Cited by 206
A general model for online probabilistic plan recognition
Bui, H. (2003) · Cited by 189
Cited by
Autonomous agents modelling other agents: A comprehensive survey and open problems
Albrecht, S. V., & Stone, P. (2018) · Artificial Intelligence · doi:10.1016/j.artint.2018.01.002 · Cited by 417
“(Ramı́rez and Geffner, 2010) yes no yes yes no –∗∗ discrete full”
MethodDeliberation for autonomous robots: A survey
Ingrand, F., & Ghallab, M. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.003 · Cited by 309
Interpretable Goal Recognition in the Presence of Occluded Factors for Autonomous Vehicles
Hanna, J. P., Rahman, A., Fosong, E., Eiras, F., Dobre, M., Redford, J., Ramamoorthy, S., & Albrecht, S. V. (2021) · 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros51168.2021.9635903 · Cited by 21
Interpretable Goal-based Prediction and Planning for Autonomous Driving
Albrecht, S. V., Brewitt, C., Wilhelm, J., Gyevnar, B., Eiras, F., Dobre, M., & Ramamoorthy, S. (2021) · 2021 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra48506.2021.9560849 · Cited by 12
Metadata
- Authors
- Ramírez, M., & Geffner, H.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2010-07-04
- Volume
- 24
- Issue
- 1
- Pages
- 1121-1126
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W1572384134
- Cited by
- 274
- References
- 19
- FWCI
- 7.54
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners. https://app.cochat.ai/papers/10.1609/aaai.v24i1.7745
- The paper
- Ramírez, M., & Geffner, H. (2010). Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v24i1.7745
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.