On the public citation graph
Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art
0 signed · 84 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/1-4020-8141-3_38openalex-snapshot
Controller Synthesis for Probabilistic Systems (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-540-73580-9_20openalex-snapshot
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_47openalex-snapshot
PRISM 4.0: Verification of Probabilistic Real-Time Systems
inferredcites →https://doi.org/10.1007/s10009-008-0092-zopenalex-snapshot
Directed model checking with distance-preserving abstractions
inferredcites →https://doi.org/10.1016/0004-3702(94)00011-oopenalex-snapshot
Learning to act using real-time dynamic programming
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50024-xopenalex-snapshot
Operational and Algebraic Semantics of Concurrent Processes
inferredcites →https://doi.org/10.1016/j.artint.2016.01.007openalex-snapshot
Optimal cost almost-sure reachability in POMDPs
inferredcites →https://doi.org/10.1016/s0004-3702(00)00047-3openalex-snapshot
Bounded-parameter Markov decision processes
inferredcites →https://doi.org/10.1016/s0004-3702(01)00106-0openalex-snapshot
LAO∗: A heuristic search algorithm that finds solutions with loops
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1109/dsn.2011.5958249openalex-snapshot
Incremental quantitative verification for Markov decision processes
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1145/1102351.1102423openalex-snapshot
Bounded real-time dynamic programming
inferredcites →https://doi.org/10.1201/9781315140223openalex-snapshot
Constrained Markov Decision Processes
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.1609/aaai.v24i1.7752openalex-snapshot
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs
inferredcites →https://doi.org/10.1609/aaai.v25i1.8016openalex-snapshot
Extending Classical Planning Heuristics to Probabilistic Planning with Dead-Ends
inferredcites →https://doi.org/10.1609/aaai.v26i1.8363openalex-snapshot
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
inferredcites →https://doi.org/10.1609/aaai.v26i1.8367openalex-snapshot
Stochastic Safest and Shortest Path Problems
inferredcites →https://doi.org/10.1609/aaai.v26i1.8369openalex-snapshot
Action Selection for MDPs: Anytime AO* Versus UCT
inferredcites →https://doi.org/10.1609/aaai.v29i1.9683openalex-snapshot
Optimal Cost Almost-Sure Reachability in POMDPs
inferredcites →https://doi.org/10.1609/aaai.v30i1.10423openalex-snapshot
RAO*: An Algorithm for Chance-Constrained POMDP's
inferredcites →https://doi.org/10.1609/aimag.v33i1.2392openalex-snapshot
A Survey of the Seventh International Planning Competition
inferredcites →https://doi.org/10.1609/icaps.v19i1.13345openalex-snapshot
Preferred Operators and Deferred Evaluation in Satisficing Planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
inferredcites →https://doi.org/10.1609/icaps.v21i1.13452openalex-snapshot
Heuristic Search for Generalized Stochastic Shortest Path MDPs
inferredcites →https://doi.org/10.1609/icaps.v22i1.13515openalex-snapshot
Resource-Constrained Planning: A Monte Carlo Random Walk Approach
inferredcites →https://doi.org/10.1609/icaps.v22i1.13518openalex-snapshot
PROST: Probabilistic Planning Based on UCT
inferredcites →https://doi.org/10.1609/icaps.v22i1.13520openalex-snapshot
Improved Non-Deterministic Planning by Exploiting State Relevance
inferredcites →https://doi.org/10.1609/icaps.v22i1.13522openalex-snapshot
Pruning Methods for Optimal Delete-Free Planning
inferredcites →https://doi.org/10.1609/icaps.v22i1.13532openalex-snapshot
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut
inferredcites →https://doi.org/10.1609/icaps.v23i1.13557openalex-snapshot
Trial-Based Heuristic Tree Search for Finite Horizon MDPs
inferredcites →https://doi.org/10.1609/icaps.v23i1.13605openalex-snapshot
Counterexample-Guided Cartesian Abstraction Refinement
inferredcites →https://doi.org/10.1609/icaps.v24i1.13615openalex-snapshot
Revisiting Risk-Sensitive MDPs: New Algorithms and Results
inferredcites →https://doi.org/10.1609/icaps.v24i1.13639openalex-snapshot
Diverse and Additive Cartesian Abstraction Heuristics
inferredcites →https://doi.org/10.1609/icaps.v25i1.13684openalex-snapshot
Simulated Penetration Testing: From "Dijkstra" to "Turing Test++"
inferredcites →https://doi.org/10.1609/icaps.v26i1.13740openalex-snapshot
Revisiting Goal Probability Analysis in Probabilistic Planning
inferredcites →https://doi.org/10.1609/icaps.v26i1.13773openalex-snapshot
From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends
inferredcites →https://doi.org/10.1613/jair.1688openalex-snapshot
mGPT: A Probabilistic Planner Based on Heuristic Search
inferredcites →https://doi.org/10.1613/jair.1880openalex-snapshot
The First Probabilistic Track of the International Planning Competition
inferredcites →https://doi.org/10.1613/jair.3788openalex-snapshot
Incremental Clustering and Expansion for Faster Optimal Planning in Decentralized POMDPs
inferredcites →https://doi.org/10.1613/jair.4443openalex-snapshot
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.3233/978-1-61499-098-7-252openalex-snapshot
Opportunistic Branched Plans to Maximise Utility in the Presence of Resource Uncertainty
inferredcites →https://doi.org/10.3233/978-1-61499-419-0-441openalex-snapshot
“Distance”? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability
inferredcites →https://doi.org/10.48550/arxiv.1210.4875openalex-snapshot
A Theory of Goal-Oriented MDPs with Dead Ends
inferredcites →https://doi.org/10.48550/arxiv.1401.3910openalex-snapshot
Topological Value Iteration Algorithms
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-331openalex-snapshot
Computing perfect heuristics in polynomial time : on bisimulation and merge-and-shrink abstractions in optimal planning
inferredcites →https://doi.org/10.7551/mitpress/2026.003.0005openalex-snapshot
Learning to act using real-time dynamic programming
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/978-3-030-03928-8_23openalex-snapshot
When a Robot Reaches Out for Human Help
inferred← citeshttps://doi.org/10.1007/978-3-030-17502-3_5openalex-snapshot
The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models
inferred← citeshttps://doi.org/10.1007/978-3-030-83723-5_15openalex-snapshot
On Correctness, Precision, and Performance in Quantitative Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-85172-9_2openalex-snapshot
A Modest Approach to Dynamic Heuristic Search in Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-18461-1_27openalex-snapshot
Learning to Solve Sequential Planning Problems Without Rewards
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_11openalex-snapshot
Efficient Formally Verified Maximal End Component Decomposition for MDPs
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_20openalex-snapshot
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_19openalex-snapshot
Multi-cost Bounded Reachability in MDP
inferred← citeshttps://doi.org/10.1007/s10817-020-09574-9openalex-snapshot
Multi-cost Bounded Tradeoff Analysis in MDP
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103864openalex-snapshot
Risk-aware analysis for interpretations of probabilistic achievement and maintenance commitments
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104505openalex-snapshot
Efficient constraint generation for stochastic shortest path problems
inferred← citeshttps://doi.org/10.1016/j.ijar.2021.09.003openalex-snapshot
Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106342openalex-snapshot
Quantitative controller synthesis for consumption Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.robot.2021.103800openalex-snapshot
Safe path planning for UAV urban operation under GNSS signal occlusion risk
inferred← citeshttps://doi.org/10.1109/allerton.2017.8262843openalex-snapshot
Transition-based versus state-based reward functions for MDPs with Value-at-Risk
inferred← citeshttps://doi.org/10.1109/tac.2020.3035755openalex-snapshot
Control Theory Meets POMDPs: A Hybrid Systems Approach
inferred← citeshttps://doi.org/10.1145/3297280.3297473openalex-snapshot
Towards automated network mitigation analysis
inferred← citeshttps://doi.org/10.1145/3720501openalex-snapshot
A Unifying Approach to Product Constructions for Quantitative Temporal Inference
inferred← citeshttps://doi.org/10.1155/2021/9922466openalex-snapshot
Improved AND/OR Tree Search Algorithm in Analysis of Stochastic and Time-Dependent Shortest Path Problem
inferred← citeshttps://doi.org/10.11606/d.45.2020.tde-30062021-195910openalex-snapshot
Heuristics based on projection occupation measures for probabilistic planning with dead-ends and risk
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12090openalex-snapshot
Stackelberg Planning: Towards Effective Leader-Follower State Space Search
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6596openalex-snapshot
Modeling Probabilistic Commitments for Maintenance Is Inherently Harder than for Achievement
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13887openalex-snapshot
Compiling Probabilistic Model Checking into Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31517openalex-snapshot
Explaining the Space of SSP Policies via Policy-Property Dependencies: Complexity, Algorithms, and Relation to Multi-Objective Planning
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18507openalex-snapshot
Guiding Search with Generalized Policies for Probabilistic Planning
inferred← citeshttps://doi.org/10.1613/jair.1.11595openalex-snapshot
Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison
inferred← citeshttps://doi.org/10.1613/jair.5500openalex-snapshot
The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes
inferred← citeshttps://doi.org/10.24963/ijcai.2017/597openalex-snapshot
Reduction Techniques for Model Checking and Learning in MDPs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.05088openalex-snapshot
Towards Automated Network Mitigation Analysis (extended)
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06096openalex-snapshot
Safe Reinforcement Learning via Probabilistic Shields
inferred← citeshttps://doi.org/10.54364/aaiml.2023.1150openalex-snapshot
Goal Agnostic Learning and Planning without Reward Functions
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.