The DOI matches its Crossref record; 78 of the 82 references it cites were found in a registry or an index.
Planning and acting in partially observable stochastic domains
Open accessOverview
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Complementing these approaches, several formal frameworks capture aspects of action-perception coupling by enabling agents to anticipate how sensory inputs evolve under their actions, and by treating action, observation, and internal state as mutually dependent. This includes General Value Functions (Sutton et al., 2011), Predictive State Representations (Littman et al., 2002), Partially Observa”
From Toward Enactive Artificial Intelligence (2026) · cites this paper as Kaelbling et al., 1998
In the citing paper
“As a sufficient statistic of h t , the belief provides all information needed for optimal decision-making.”
From Meta-Cognitive Memory Policy Optimization for Long-Horizon LLM Agents (2026) · cites this paper as Kaelbling et al., 1998
In the citing paper
“For the real-world data, we utilize the Waymo Open Dataset [27], which contains recordings from six cities across the United States. It includes a wide variety of challenging scenarios, such as unprotected turns, merges, lane changes, and complex intersection interactions, making it particularly well-suited for our task.”
From Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving (2026) · cites this paper as [27]
In the citing paper
“The classic notion of POMDPs(Kaelbling et al., 1998) includes a state space, but we omit it because we assume that it is unknown.”
From When Do Transformers Shine in RL? Decoupling Memory from Credit Assignment (2023) · cites this paper as Kaelbling et al., 1998
In the citing paper
“One way to solve this problem is by using observations to form a Bayesian posterior estimate of each hidden state, called a belief state [5].”
From Emergence of belief-like representations through reinforcement learning (2023) · cites this paper as [5]
2 more claims about this paper
Create a free account to see every claim other papers make about this one.
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
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743 · cited 1×
“One approach is to extend techniques for learning hidden Markov models [41, 51] to learn pomdp models.”
MethodGenetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
(1995) · Cited by 10,558
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
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
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
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Proceedings of the 16th international joint conference on Artificial Intelligence - IJCAI '99
Colton, S., Bundy, A., & Walsh, T. (1999) · Cited by 2,500
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Baxter, L. A. (1995) · Technometrics · doi:10.1080/00401706.1995.10484354 · Cited by 2,415
Cited by
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Deep Reinforcement Learning: A Brief Survey
Arulkumaran, K., Deisenroth, M. P., Brundage, M., & Bharath, A. A. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2743240 · Cited by 4,733
“A generalisation of MDPs are partially observable MDPs (POMDPs), in which the agent receives an observation ot ∈ Ω, where the distribution of the observation p(ot+1|st+1,at) is dependent on the current state and the previous action [45].”
A Brief Survey of Deep Reinforcement Learning
Arulkumaran, K., Deisenroth, M. P., Brundage, M., & Bharath, A. A. (2017) · arXiv · doi:10.48550/arxiv.1708.05866 · Cited by 4,733
Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
“A different body of works formulates active SLAM under the formalism of Partially Observably Markov Decision Process [123], which in general is known to be computationally intractable; approximate”
Metadata
- Authors
- Kaelbling, L. P., Littman, M. L., & Cassandra, A. R.
- Affiliations
- Duke University (US)
- Corresponding author
- Kaelbling, Leslie Pack
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1998-05
- Volume
- 101
- Issue
- 1-2
- Pages
- 99-134
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2168359464
- Cited by
- 4,149
- References
- 82
- Citations by year
- 2026: 237 · 2025: 156 · 2024: 203 · 2023: 219 · 2022: 214 · 2021: 264 · 2020: 241 · 2019: 229 · 2018: 185 · 2017: 182 · 2016: 165 · 2015: 199 · 2014: 176 · 2013: 180 · 2012: 185
- FWCI
- 36.54
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 5564 d)
- Locations
- Artificial Intelligence (publishedVersion)
- Funders
- National Science Foundation (9453383, CAREER, 9702576, 9312395)
- Defense Advanced Research Projects Agency
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- Keywords
- partially observable Markov decision processes, Markov decision process, optimal action selection, operations research techniques, approximate solutions, sequential decision making
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: Planning and acting in partially observable stochastic domains. https://app.cochat.ai/papers/10.1016/s0004-3702(98)00023-x
- The paper
- Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998). Planning and acting in partially observable stochastic domains. Artificial Intelligence. https://doi.org/10.1016/s0004-3702(98)00023-x
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.