On the public citation graph
A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02055574openalex-snapshot
A survey of algorithmic methods for partially observed Markov decision processes
inferredcites →https://doi.org/10.1007/bf02204836openalex-snapshot
A survey of solution techniques for the partially observed Markov decision process
inferredcites →https://doi.org/10.1016/0305-0548(93)90051-jopenalex-snapshot
Markov decision processes
inferredcites →https://doi.org/10.1016/0377-2217(89)90348-2openalex-snapshot
Markov decision processes
inferredcites →https://doi.org/10.1109/9.24227openalex-snapshot
Adaptive aggregation methods for infinite horizon dynamic programming
inferredcites →https://doi.org/10.1109/iros.1996.571080openalex-snapshot
Acting under uncertainty: discrete Bayesian models for mobile-robot navigation
inferredcites →https://doi.org/10.1287/opre.32.5.1107openalex-snapshot
The Optimal Search for a Moving Target When the Search Path Is Constrained
inferredcites →https://doi.org/10.1287/opre.39.1.162openalex-snapshot
Computationally Feasible Bounds for Partially Observed Markov Decision Processes
inferredcites →https://doi.org/10.1287/opre.42.3.439openalex-snapshot
Finite-Memory Suboptimal Design for Partially Observed Markov Decision Processes
inferredcites →https://doi.org/10.14288/1.0098252openalex-snapshot
Algorithms for partially observable Markov decision processes
inferredcites →https://doi.org/10.48550/arxiv.1302.1525openalex-snapshot
Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
inferredcites →https://doi.org/10.48550/arxiv.1302.1533openalex-snapshot
Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ece3.9197openalex-snapshot
Partial observability and management of ecological systems
inferred← citeshttps://doi.org/10.1007/11518655_19openalex-snapshot
APPSSAT: Approximate Probabilistic Planning Using Stochastic Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-44565-x_12openalex-snapshot
Hidden-Mode Markov Decision Processes for Nonstationary Sequential Decision Making
inferred← citeshttps://doi.org/10.1007/3-540-44652-4_7openalex-snapshot
Value Iteration over Belief Subspace
inferred← citeshttps://doi.org/10.1007/3-540-44652-4_8openalex-snapshot
Space-Progressive Value Iteration: An Anytime Algorithm for a Class of POMDPs
inferred← citeshttps://doi.org/10.1007/s12351-010-0095-xopenalex-snapshot
The partially observable Markov decision processes in healthcare: an application to patients with ischemic heart disease (IHD)
inferred← citeshttps://doi.org/10.1016/j.ijar.2006.06.016openalex-snapshot
APPSSAT: Approximate probabilistic planning using stochastic satisfiability
inferred← citeshttps://doi.org/10.1080/10798587.2004.10642878openalex-snapshot
Improved QMDPPolicy for Partially Observable Markov Decision Processes in Large Domains: Embedding Exploration Dynamics
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400106openalex-snapshot
Polynomial-time solution of change detection problems
inferred← citeshttps://doi.org/10.1109/icct.2000.889257openalex-snapshot
Using reinforcement learning for pro-active network fault management
inferred← citeshttps://doi.org/10.1109/romoco.2005.201394openalex-snapshot
Information spaces for mobile robots
inferred← citeshttps://doi.org/10.1142/s0219622011004762openalex-snapshot
PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES AND PERIODIC POLICIES WITH APPLICATIONS
inferred← citeshttps://doi.org/10.1145/347476.347480openalex-snapshot
Complexity of finite-horizon Markov decision process problems
inferred← citeshttps://doi.org/10.1201/9781420019445.ch13openalex-snapshot
Algorithms for Planning under Uncertainty in Prediction and Sensing
inferred← citeshttps://doi.org/10.1613/jair.1379openalex-snapshot
Restricted Value Iteration: Theory and Algorithms
inferred← citeshttps://doi.org/10.1613/jair.575openalex-snapshot
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
inferred← citeshttps://doi.org/10.1613/jair.678openalex-snapshot
Value-Function Approximations for Partially Observable Markov Decision Processes
inferred← citeshttps://doi.org/10.1613/jair.761openalex-snapshot
Speeding Up the Convergence of Value Iteration in Partially Observable Markov Decision Processes
inferred← citeshttps://doi.org/10.2172/789585openalex-snapshot
Foundations for Reasoning in Cognition-Based Computational Representations of Human Decision Making
inferred← citeshttps://doi.org/10.48550/arxiv.1207.4154openalex-snapshot
Discretized Approximations for POMDP with Average Cost
inferred← citeshttps://doi.org/10.48550/arxiv.1301.6751openalex-snapshot
A Method for Speeding Up Value Iteration in Partially Observable Markov Decision Processes
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7417openalex-snapshot
Planning with Partially Observable Markov Decision Processes: Advances in Exact Solution Method
inferred← citeshttps://doi.org/10.5555/777092.777142openalex-snapshot
Value iteration working with belief subset
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.