On the public citation graph

DESPOT-Alpha: Online POMDP Planning with Large State and Observation Spaces

0 signed · 56 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0004-3702(98)00023-xopenalex-snapshot
Planning and acting in partially observable stochastic domains
inferredcites →https://doi.org/10.1023/aopenalex-snapshot
Algebraic decay in hierarchical graphs
inferredcites →https://doi.org/10.1023/a:1009634810396openalex-snapshot
Rollout Algorithms for Stochastic Scheduling Problems
inferredcites →https://doi.org/10.1023/a:1017932429737openalex-snapshot
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
inferredcites →https://doi.org/10.1109/cdc.2000.912059openalex-snapshot
A framework for simulation-based network control via hindsight optimization
inferredcites →https://doi.org/10.1109/icra.2015.7139219openalex-snapshot
Intention-aware online POMDP planning for autonomous driving in a crowd
inferredcites →https://doi.org/10.1177/0278364914528255openalex-snapshot
Integrated perception and planning in the continuous space: A POMDP approach
inferredcites →https://doi.org/10.1287/opre.21.5.1071openalex-snapshot
The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
inferredcites →https://doi.org/10.15607/rss.2008.iv.009openalex-snapshot
SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces
inferredcites →https://doi.org/10.15607/rss.2018.xiv.004openalex-snapshot
HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty
inferredcites →https://doi.org/10.1609/icaps.v25i1.13706openalex-snapshot
PLEASE: Palm Leaf Search for POMDPs with Large Observation Spaces
inferredcites →https://doi.org/10.1609/socs.v6i1.18339openalex-snapshot
PLEASE: Palm Leaf Search for POMDPs with Large Observation Spaces
inferredcites →https://doi.org/10.1613/jair.1659openalex-snapshot
Perseus: Randomized Point-based Value Iteration for POMDPs
inferredcites →https://doi.org/10.1613/jair.2567openalex-snapshot
Online Planning Algorithms for POMDPs
inferredcites →https://doi.org/10.1613/jair.5328openalex-snapshot
DESPOT: Online POMDP Planning with Regularization
inferredcites →https://doi.org/10.1613/jair.678openalex-snapshot
Value-Function Approximations for Partially Observable Markov Decision Processes
inferredcites →https://doi.org/10.1613/jair.761openalex-snapshot
Speeding Up the Convergence of Value Iteration in Partially Observable Markov Decision Processes
inferredcites →https://doi.org/10.48550/arxiv.1207.1412openalex-snapshot
Point-Based POMDP Algorithms: Improved Analysis and Implementation
inferredcites →https://doi.org/10.48550/arxiv.1301.3878openalex-snapshot
PEGASUS: A Policy Search Method for Large MDPs and POMDPs
inferredcites →https://doi.org/10.48550/arxiv.1802.06215openalex-snapshot
HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty
inferredcites →https://doi.org/10.5555/1036843.1036906openalex-snapshot
Heuristic search value iteration for POMDPs
inferredcites →https://doi.org/10.7551/mitpress/8344.003.0013openalex-snapshot
SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10489-022-03914-5openalex-snapshot
High-efficiency online planning using composite bounds search under partial observation
inferred← citeshttps://doi.org/10.1007/s10846-021-01489-wopenalex-snapshot
End-to-End Probabilistic Depth Perception and 3D Obstacle Avoidance using POMDP
inferred← citeshttps://doi.org/10.1016/j.cogr.2024.06.001openalex-snapshot
POMDP-based probabilistic decision making for path planning in wheeled mobile robot
inferred← citeshttps://doi.org/10.1016/j.mex.2024.102552openalex-snapshot
An algorithm to create model file for Partially Observable Markov Decision Process for mobile robot path planning
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683490openalex-snapshot
Voronoi Progressive Widening: Efficient Online Solvers for Continuous State, Action, and Observation POMDPs
inferred← citeshttps://doi.org/10.1109/icra46639.2022.9812343openalex-snapshot
Gaussian Belief Trees for Chance Constrained Asymptotically Optimal Motion Planning
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9560943openalex-snapshot
An On-Line POMDP Solver for Continuous Observation Spaces
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561047openalex-snapshot
Efficient Multi-scale POMDPs for Robotic Object Search and Delivery
inferred← citeshttps://doi.org/10.1109/ictai59109.2023.00102openalex-snapshot
Improving Online POMDP Planning Algorithms with Decaying Q Value
inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981442openalex-snapshot
Speeding up POMDP Planning via Simplification
inferred← citeshttps://doi.org/10.1109/iros51168.2021.9636737openalex-snapshot
Multi-Resolution POMDP Planning for Multi-Object Search in 3D
inferred← citeshttps://doi.org/10.1109/itsc48978.2021.9564408openalex-snapshot
Handling Prediction Model Errors in Planning for Automated Driving Using POMDPs
inferred← citeshttps://doi.org/10.1109/lra.2025.3606381openalex-snapshot
Previous Knowledge Utilization in Online Anytime Belief Space Planning
inferred← citeshttps://doi.org/10.1109/tac.2023.3250159openalex-snapshot
Smoother Entropy for Active State Trajectory Estimation and Obfuscation in POMDPs
inferred← citeshttps://doi.org/10.1109/tac.2023.3264177openalex-snapshot
Entropy-Regularized Partially Observed Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/tcds.2020.3034428openalex-snapshot
A Partially Observable Markov-Decision-Process-Based Blackboard Architecture for Cognitive Agents in Partially Observable Environments
inferred← citeshttps://doi.org/10.1109/tii.2023.3248086openalex-snapshot
A Fast Online Planning Under Partial Observability Using Information Entropy Rewards
inferred← citeshttps://doi.org/10.1109/tro.2023.3334631openalex-snapshot
Shared Autonomy of a Robotic Manipulator for Grasping Under Human Intent Uncertainty Using POMDPs
inferred← citeshttps://doi.org/10.1126/scirobotics.ado1010openalex-snapshot
Monte Carlo tree search with spectral expansion for planning with dynamical systems
inferred← citeshttps://doi.org/10.1145/3564246.3585099openalex-snapshot
Planning and Learning in Partially Observable Systems via Filter Stability
inferred← citeshttps://doi.org/10.1155/joro/6114590openalex-snapshot
Information‐Theoretic Path Planning for Safe and Adaptive Nanobot Drug Delivery
inferred← citeshttps://doi.org/10.1177/1729881421999587openalex-snapshot
Scalable information-theoretic path planning for a rover-helicopter team in uncertain environments
inferred← citeshttps://doi.org/10.15607/rss.2020.xvi.023openalex-snapshot
Controlling Contact-Rich Manipulation Under Partial Observability
inferred← citeshttps://doi.org/10.1575/1912/29316openalex-snapshot
Balancing exploration and exploitation: task-targeted exploration for scientific decision-making
inferred← citeshttps://doi.org/10.1609/aaai.v38i16.29689openalex-snapshot
Factored Online Planning in Many-Agent POMDPs
inferred← citeshttps://doi.org/10.1613/jair.1.14525openalex-snapshot
Optimality Guarantees for Particle Belief Approximation of POMDPs
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867569openalex-snapshot
JEM: Joint Entropy Minimization for Active State Estimation with Linear POMDP Costs
inferred← citeshttps://doi.org/10.3390/s22176615openalex-snapshot
A Design Framework of Exploration, Segmentation, Navigation, and Instruction (ESNI) for the Lifecycle of Intelligent Mobile Agents as a Method for Mapping an Unknown Built Environment
inferred← citeshttps://doi.org/10.48550/arxiv.2004.10099openalex-snapshot
pomdp_py: A Framework to Build and Solve POMDP Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2102.09539openalex-snapshot
iX-BSP: Incremental Belief Space Planning
inferred← citeshttps://doi.org/10.48550/arxiv.2105.05296openalex-snapshot
Online POMDP Planning via Simplification
inferred← citeshttps://doi.org/10.48550/arxiv.2105.05789openalex-snapshot
Probabilistic Loss and its Online Characterization for Simplified Decision Making Under Uncertainty
inferred← citeshttps://doi.org/10.48550/arxiv.2105.14239openalex-snapshot
Simplified Belief-Dependent Reward MCTS Planning with Guaranteed Tree Consistency
inferred← citeshttps://doi.org/10.5445/ir/1000133453openalex-snapshot
Information particle filter tree: An online algorithm for POMDPs with belief-based rewards on continuous domains
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.