On the public citation graph
Engineering a Conformant Probabilistic Planner
0 signed · 29 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.1002/aaai.12169openalex-snapshot
The 2023 International Planning Competition
inferredcites →https://doi.org/10.1016/0004-3702(94)00087-hopenalex-snapshot
An algorithm for probabilistic planning
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(02)00379-xopenalex-snapshot
Contingent planning under uncertainty via stochastic satisfiability
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
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.1016/s0004-3702(99)00010-7openalex-snapshot
Using regression-match graphs to control search in planning
inferredcites →https://doi.org/10.1017/s0269888900001089openalex-snapshot
Bridging the gap between planning and scheduling
inferredcites →https://doi.org/10.1613/jair.1136openalex-snapshot
VHPOP: Versatile Heuristic Partial Order Planner
inferredcites →https://doi.org/10.1613/jair.1676openalex-snapshot
Decision-Theoretic Planning with non-Markovian Rewards
inferredcites →https://doi.org/10.1613/jair.1688openalex-snapshot
mGPT: A Probabilistic Planner Based on Heuristic Search
inferredcites →https://doi.org/10.1613/jair.1700openalex-snapshot
Approximate Policy Iteration with a Policy Language Bias: Solving Relational Markov Decision Processes
inferredcites →https://doi.org/10.1613/jair.1701openalex-snapshot
Engineering a Conformant Probabilistic Planner
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.393openalex-snapshot
Flaw Selection Strategies for Partial-Order Planning
inferredcites →https://doi.org/10.1613/jair.575openalex-snapshot
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
inferredcites →https://doi.org/10.1613/jair.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.artint.2007.10.018openalex-snapshot
Sequential Monte Carlo in reachability heuristics for probabilistic planning
inferred← citeshttps://doi.org/10.1109/cica.2009.4982790openalex-snapshot
Probabilistic planning integrated in a multi-level dependability concept for mechatronic systems
inferred← citeshttps://doi.org/10.1109/icra.2012.6225191openalex-snapshot
Abstract planning for reactive robots
inferred← citeshttps://doi.org/10.1109/wicom.2011.6040537openalex-snapshot
The Research of Electronic Evidence Admissibility and Evidential Power Based on Bayesian Network
inferred← citeshttps://doi.org/10.1184/r1/6561005openalex-snapshot
Strengthening Schedules Through Uncertainty Analysis
inferred← citeshttps://doi.org/10.1613/jair.1676openalex-snapshot
Decision-Theoretic Planning with non-Markovian Rewards
inferred← citeshttps://doi.org/10.1613/jair.2289openalex-snapshot
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting
inferred← citeshttps://doi.org/10.20965/jrm.2012.p0005openalex-snapshot
Probabilistic Planning for Predictive Condition Monitoring and Adaptation Within the Self-Optimizing Energy Management of an Autonomous Railway Vehicle
inferred← citeshttps://doi.org/10.37099/mtu.dc.etds/943openalex-snapshot
GENERATING PLANS IN CONCURRENT, PROBABILISTIC, OVER-SUBSCRIBED DOMAINS
showing the first 9 of 10 · page through all 10
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.