The DOI matches its Crossref record.
State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
Abstract
This paper surveys models and algorithms dealing with partially observable Markov decision processes. A partially observable Markov decision process (POMDP) is a generalization of a Markov decision process which permits uncertainty regarding the state of a Markov process and allows for state information acquisition. A general framework for finite state and action POMDP's is presented. Next, there is a brief discussion of the development of POMDP's and their relationship with other decision processes. A wide range of models in such areas as quality control, machine maintenance, internal auditing, learning, and optimal stopping are discussed within the POMDP-framework. Lastly, algorithms for computing optimal solutions to POMDP's are presented.
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
Cited by
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
Applications of Deep Reinforcement Learning in Communications and Networking: A Survey
Luong, N. C., Hoang, D. T., Gong, S., Niyato, D., Wang, P., Liang, Y.-C., & Kim, D. I. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2916583 · Cited by 2,060
Resource Management with Deep Reinforcement Learning
Mao, H., Alizadeh, M., Menache, I., & Kandula, S. (2016) · Proceedings of the 15th ACM Workshop on Hot Topics in Networks · doi:10.1145/3005745.3005750 · Cited by 1,353
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
Optimal Lot Sizing, Process Quality Improvement and Setup Cost Reduction
Porteus, E. L. (1986) · Operations Research · doi:10.1287/opre.34.1.137 · Cited by 1,158
Ephraim, Y., & Merhav, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003838 · Cited by 798
Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
Arapostathis, A., Borkar, V. S., Fernández-Gaucherand, E., Ghosh, M. K., & Marcus, S. I. (1993) · SIAM Journal on Control and Optimization · doi:10.1137/0331018 · Cited by 592
A survey of algorithmic methods for partially observed Markov decision processes
Lovejoy, W. S. (1991) · Annals of Operations Research · doi:10.1007/bf02055574 · Cited by 532
Probabilistic Algorithms and the Interactive Museum Tour-Guide Robot Minerva
Thrun, S., Beetz, M., Bennewitz, M., Burgard, W., Cremers, A. B., Dellaert, F., Fox, D., Hähnel, D., Rosenberg, C., Roy, N., et al. (2000) · The International Journal of Robotics Research · doi:10.1177/02783640022067922 · Cited by 516
Chen, Y., Zhao, Q., & Swami, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.920248 · Cited by 421
White, C. C., & White, D. J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90348-2 · Cited by 415
Multi-Agent Reinforcement Learning: A Review of Challenges and Applications
Canese, L., Cardarilli, G. C., Di Nunzio, L., Fazzolari, R., Giardino, D., Re, M., & Spanò, S. (2021) · Applied Sciences · doi:10.3390/app11114948 · Cited by 403
Reinforcement Learning: A Tutorial Survey and Recent Advances
Gosavi, A. (2009) · INFORMS Journal on Computing · doi:10.1287/ijoc.1080.0305 · Cited by 326
Partially Observable Markov Decision Processes
Spaan, M. T. J. (2012) · Adaptation, Learning, and Optimization · doi:10.1007/978-3-642-27645-3_12 · Cited by 315
Robust Markov Decision Processes
Wiesemann, W., Kuhn, D., & Rustem, B. (2013) · Mathematics of Operations Research · doi:10.1287/moor.1120.0566 · Cited by 312
Eliciting probabilities from experts in complex technical problems
Keeney, R. L., & von Winterfeldt, D. (1991) · IEEE Transactions on Engineering Management · doi:10.1109/17.83752 · Cited by 309
Equivalence notions and model minimization in Markov decision processes
Givan, R., Dean, T., & Greig, M. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00376-4 · Cited by 308
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
Toward Autonomous Multi-UAV Wireless Network: A Survey of Reinforcement Learning-Based Approaches
Bai, Y., Zhao, H., Zhang, X., Chang, Z., Jäntti, R., & Yang, K. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3323344 · Cited by 295
Spoken dialogue management using probabilistic reasoning
Roy, N., Pineau, J., & Thrun, S. (2000) · Proceedings of the 38th Annual Meeting on Association for Computational Linguistics - ACL '00 · doi:10.3115/1075218.1075231 · Cited by 285
Deep Reinforcement Learning-Based Automatic Exploration for Navigation in Unknown Environment
Li, H., Zhang, Q., & Zhao, D. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2927869 · Cited by 261
Algorithms for optimal scheduling and management of hidden Markov model sensors
Krishnamurthy, V. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.1003062 · Cited by 257
Zhao, T., & Eskenazi, M. (2016) · Proceedings of the 17th Annual Meeting of the Special Interest Group on Discourse and Dialogue · doi:10.18653/v1/w16-3601 · Cited by 255
Strategic maintenance management
Murthy, D. N. P., Atrens, A., & Eccleston, J. A. (2002) · Journal of Quality in Maintenance Engineering · doi:10.1108/13552510210448504 · Cited by 253
Cognitive Radio Techniques Under Practical Imperfections: A Survey
Sharma, S. K., Bogale, T. E., Chatzinotas, S., Ottersten, B., Le, L. B., & Wang, X. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2452414 · Cited by 221
Jiang, X., Yu, F. R., Song, T., & Leung, V. C. M. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3065209 · Cited by 88
How data-driven entrepreneur analyzes imperfect information for business opportunity evaluation
Canakoglu, E., Erzurumlu, S. S., & Erzurumlu, Y. O. (2018) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2018.2826983 · Cited by 47
A Survey of Exploration Methods in Reinforcement Learning
Amin, S., Gomrokchi, M., Satija, H., van Hoof, H., & Precup, D. (2021) · arXiv · doi:10.48550/arxiv.2109.00157 · Cited by 41
Why Generalization in RL is Difficult: Epistemic POMDPs and Implicit Partial Observability
Ghosh, D., Rahme, J., Kumar, A., Zhang, A., Adams, R. P., & Levine, S. (2021) · arXiv · doi:10.48550/arxiv.2107.06277 · Cited by 41
Applications of Deep Reinforcement Learning in Communications and Networking: A Survey
Luong, N. C., Hoang, D. T., Gong, S., Niyato, D., Wang, P., Liang, Y.-C., & Kim, D. I. (2018) · arXiv · doi:10.48550/arxiv.1810.07862 · Cited by 17
Learning Interactive Real-World Simulators
Yang, S., Du, Y., Ghasemipour, K., Tompson, J., Kaelbling, L., Schuurmans, D., & Abbeel, P. (2023) · arXiv · doi:10.48550/arxiv.2310.06114 · Cited by 346
“In simulating long-horizon interactions with UniSim, we develop a fundamental connection between autoregressive video generation during inference and performing rollouts in a partially observable Markov decision processes (POMDPs) [14, 15].”
Method
Metadata
- Authors
- Monahan, G. E.
- Venue
- Management Science
- Published
- 1982-01
- Volume
- 28
- Issue
- 1
- Pages
- 1-16
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2123651102
- Cited by
- 745
- References
- 0
- FWCI
- 3.05
- 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.