The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
A survey of point-based POMDP solvers
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
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Puterman, M. L. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316887 · Cited by 6,024
Planning and acting in partially observable stochastic domains
Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00023-x · Cited by 4,149
Dynamic Programming and Markov Processes.
Freimer, M., & Howard, R. A. (1961) · Journal of the American Statistical Association · doi:10.2307/2282268 · Cited by 3,378
Bellman, R. (1957) · Indiana University Mathematics Journal · doi:10.1512/iumj.1957.6.56038 · Cited by 2,408
Policy Invariance Under Reward Transformations: Theory and Application to Reward Shaping
Ng, A. Y., Harada, D., & Russell, S. (1999) · Cited by 1,744
The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
Smallwood, R. D., & Sondik, E. J. (1973) · Operations Research · doi:10.1287/opre.21.5.1071 · Cited by 1,479
Point-based value iteration: an anytime algorithm for POMDPs
Pineau, J., Gordon, G., & Thrun, S. (2003) · International Joint Conference on Artificial Intelligence · Cited by 1,209
Self-citationLearning to act using real-time dynamic programming
Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00011-o · Cited by 1,104
Partially observable Markov decision processes for spoken dialog systems
Williams, J. D., & Young, S. (2007) · Computer Speech & Language · doi:10.1016/j.csl.2006.06.008 · Cited by 853
SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces
Kurniawati, H., Hsu, D., & Sun Lee, W. (2008) · Robotics: Science and Systems IV · doi:10.15607/rss.2008.iv.009 · Cited by 759
Using anytime algorithms in intelligent systems
Shlomo Zilberstein, B. (1996) · doi:10.1609/aimag.v17i3.1232 · Cited by 680
Learning policies for partially observable environments: Scaling up
Littman, M. L., Cassandra, A. R., & Kaelbling, L. P. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50052-9 · Cited by 650
Predictive Representations of State
Littman, M. L., & Sutton, R. S. (2001) · neural information processing systems · Cited by 600
Reinforcement learning with replacing eligibility traces
Singh, S. P., & Sutton, R. S. (1996) · Machine Learning · doi:10.1007/bf00114726 · Cited by 575
Sondik, E. J. (1978) · Operations Research · doi:10.1287/opre.26.2.282 · Cited by 536
Value-Function Approximations for Partially Observable Markov Decision Processes
Hauskrecht, M. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.678 · Cited by 527
Perseus: Randomized point-based value iteration for POMDPs
Spaan, M. T. J., & Vlassis, N. A. (2005) · UvA-DARE (University of Amsterdam) · Cited by 526
(2004) · doi:10.5555/1036843.1036906 · Cited by 417
Anytime Point-Based Approximations for Large POMDPs
Pineau, J., Gordon, G., & Thrun, S. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2078 · Cited by 370
Self-citationIncremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
Cassandra, A. R., Littman, M. L., & Zhang, N. L. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.1525 · Cited by 361
Algorithms for Sequential Decision Making
Littman, M. L. (1996) · Cited by 341
Perseus: Randomized Point-based Value Iteration for POMDPs
Spaan, M. T. J., & Vlassis, N. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1659 · Cited by 331
Computationally Feasible Bounds for Partially Observed Markov Decision Processes
Lovejoy, W. S. (1991) · Operations Research · doi:10.1287/opre.39.1.162 · Cited by 307
Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming
Bonet, B., & Geffner, H. (2003) · Cited by 298
A POMDP formulation of preference elicitation problems
Boutilier, C. E. (2002) · doi:10.5555/777092.777132 · Cited by 263
Exploiting structure to efficiently solve large scale partially observable markov decision processes
Poupart, P. (2005) · Cited by 247
Point-Based Value Iteration for Continuous POMDPs
Porta, J. M., Vlassis, N. A., Spaan, M. T. J., & Poupart, P. (2006) · DIGITAL.CSIC (Spanish National Research Council (CSIC)) · doi:10.13039/501100000780 · Cited by 234
Hoey, J., Poupart, P., Bertoldi, A. V., Craig, T., Boutilier, C., & Mihailidis, A. (2010) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2009.06.008 · Cited by 229
Bounded Finite State Controllers
Poupart, P., & Boutilier, C. E. (2003) · neural information processing systems · Cited by 205
Solving POMDPs by Searching in Policy Space
Hansen, E. A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7380 · Cited by 187
Planning treatment of ischemic heart disease with partially observable Markov decision processes
Hauskrecht, M., & Fraser, H. (2000) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(99)00042-1 · Cited by 173
The Optimal Control of Partially Observable Markov Decision Processes.
Sondik, E. J. (1971) · Medical Entomology and Zoology · Cited by 170
Hsiao, K., Kaelbling, L. P., & Lozano‐Pérez, T. (2007) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2007.364201 · Cited by 150
A point-based POMDP algorithm for robot planning
Spaan, M. T. J., & Spaan, N. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2004.1307420 · Cited by 145
Speeding Up the Convergence of Value Iteration in Partially Observable Markov Decision Processes
Zhang, N. L., & Zhang, W. (2001) · Journal of Artificial Intelligence Research · doi:10.1613/jair.761 · Cited by 140
Solving POMDPs: RTDP-bel vs. point-based algorithms
Bonet, B., & Geffner, H. (2009) · International Joint Conference on Artificial Intelligence · Cited by 130
Point-Based POMDP Algorithms: Improved Analysis and ImplementationPreprint
Smith, T., & Simmons, R. G. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1412 · Cited by 115
AEMS: an anytime online search algorithm for approximate policy refinement in large POMDPs
Ross, S., & Chaib-draa, B. (2007) · International Joint Conference on Artificial Intelligence · Cited by 87
Symbolic Dynamic Programming for First-order POMDPs
Sanner, S., & Kersting, K. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7747 · Cited by 86
Prioritization Methods for Accelerating MDP Solvers
Wingate, D., & Seppi, K. D. (2005) · ScholarsArchive (Brigham Young University) · doi:10.5555/1046920.1088701 · Cited by 84
Forward search value iteration for POMDPs
Shani, G., Brafman, R. I., & Shimony, S. E. (2007) · Cited by 82
Self-citationClosing the Gap: Improved Bounds on Optimal POMDP Solutions
Poupart, P., Kim, K.-E., & Kim, D. (2011) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v21i1.13467 · Cited by 71
Incremental methods for computing bounds in partially observable Markov decision processes
Hauskrecht, M. (1997) · Cited by 63
Topological value iteration algorithm for Markov decision processes
Dai, P., & Goldsmith, J. (2007) · International Joint Conference on Artificial Intelligence · Cited by 60
Ji, S., Parr, R., Li, H., Liao, X., & Carin, L. (2007) · National Conference on Artificial Intelligence · Cited by 47
POMDP Planning for Robust Robot Control
Pineau, J., & Gordon, G. J. (2007) · Springer eBooks · doi:10.1007/978-3-540-48113-3_7 · Cited by 46
Self-citationSymbolic heuristic search value iteration for factored POMDPs
Sim, H. S., Kim, K.-E., Kim, J. H., Chang, D.-S., & Koo, M. (2008) · National Conference on Artificial Intelligence · Cited by 45
Continuous-State POMDPs with Hybrid Dynamics
Brunskill, E., Kaelbling, L. P., Lozano‐Pérez, T., & Roy, N. (2008) · International Symposium on Artificial Intelligence and Mathematics · Cited by 43
The permutable POMDP: fast solutions to POMDPs for preference elicitation
Doshi‐Velez, F., & Roy, N. (2008) · doi:10.5555/1402383.1402454 · Cited by 37
Development and Validation of a Robust Speech Interface for Improved Human-Robot Interaction
Atrash, A., Kaplow, R., Villemure, J., West, R., Yamani, H., & Pineau, J. (2009) · International Journal of Social Robotics · doi:10.1007/s12369-009-0032-4 · Cited by 35
Self-citationA fast heuristic algorithm for decision-theoretic planning
Poon, L. K. M. (2001) · doi:10.14711/thesis-b711441 · Cited by 30
Relational Partially Observable MDPs
Wang, C., & Khardon, R. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7742 · Cited by 30
icLQG: Combining local and global optimization for control in information space
Huynh, V. A., & Roy, N. (2009) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2009.5152607 · Cited by 28
Prioritizing Point-Based POMDP Solvers
Shani, G., Brafman, R. I., & Shimony, S. E. (2008) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2008.928222 · Cited by 24
Self-citationScaling up: solving POMDPs through value based clustering
Virin, Y., Shani, G., Shimony, S. E., & Brafman, R. I. (2007) · Cited by 19
Self-citationEvaluating Point-Based POMDP Solvers on Multicore Machines
Shani, G. (2009) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2034015 · Cited by 13
Self-citationBelief Selection in Point-Based Planning Algorithms for POMDPs
Izadi, M. T., Precup, D., & Azar, D. (2006) · Lecture notes in computer science · doi:10.1007/11766247_33 · Cited by 11
Using core beliefs for point-based value iteration
Izadi, M. T., Rajwade, A. V., & Precup, D. (2005) · International Joint Conference on Artificial Intelligence · Cited by 7
Cited by
Kosorok, M. R., & Laber, E. B. (2019) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-030718-105251 · Cited by 370
A probabilistic graphical model foundation for enabling predictive digital twins at scale
Kapteyn, M. G., Pretorius, J. V. R., & Willcox, K. E. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00069-0 · Cited by 346
Intention-aware online POMDP planning for autonomous driving in a crowd
Bai, H., Cai, S., Ye, N., Hsu, D., & Lee, W. S. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139219 · Cited by 321
A unified framework for stochastic optimization
Powell, W. B. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.014 · Cited by 314
A˚ström, K. J., & Kumar, P. R. (2014) · Automatica · doi:10.1016/j.automatica.2013.10.012 · Cited by 304
Metadata
- Authors
- Shani, G., Pineau, J., & Kaplow, R.
- Venue
- Autonomous Agents and Multi-Agent Systems
- Published
- 2012-06-08
- Volume
- 27
- Issue
- 1
- Pages
- 1-51
- ISSN
- 1387-2532 (ISSN-L)
- 1573-7454
- OpenAlex
- W2055921164
- Cited by
- 422
- References
- 63
- FWCI
- 26.28
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.