On the public citation graph
Decision-Theoretic Planning with non-Markovian Rewards
0 signed · 87 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/int.4550100202openalex-snapshot
A stochastic model of actions and plans for anytime planning under uncertainty
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/3-540-51803-7_23openalex-snapshot
On the relation of programs and computations to models of temporal logic
inferredcites →https://doi.org/10.1016/0004-3702(90)90054-4openalex-snapshot
Real-time heuristic search
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/0004-3702(94)00086-gopenalex-snapshot
Planning under time constraints in stochastic domains
inferredcites →https://doi.org/10.1016/0004-3702(94)00087-hopenalex-snapshot
An algorithm for probabilistic planning
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/s0004-3702(00)00033-3openalex-snapshot
Stochastic dynamic programming with factored representations
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(99)00071-5openalex-snapshot
Using temporal logics to express search control knowledge for planning
inferredcites →https://doi.org/10.1023/a:1018985923441openalex-snapshot
Planning for temporally extended goals
inferredcites →https://doi.org/10.1093/jigpal/jzi015openalex-snapshot
Semipositive LTL with an Uninterpreted Past Operator
inferredcites →https://doi.org/10.1111/j.1467-8640.1989.tb00324.xopenalex-snapshot
A model for reasoning about persistence and causation
inferredcites →https://doi.org/10.1145/210197.210200openalex-snapshot
Efficient checking of temporal integrity constraints using bounded history encoding
inferredcites →https://doi.org/10.1613/jair.1688openalex-snapshot
mGPT: A Probabilistic Planner Based on Heuristic Search
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.575openalex-snapshot
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.2307/2282268openalex-snapshot
Dynamic Programming and Markov Processes.
inferredcites →https://doi.org/10.48550/arxiv.1212.2459openalex-snapshot
Symbolic Generalization for On-line Planning
inferredcites →https://doi.org/10.48550/arxiv.1212.2482openalex-snapshot
Implementation and Comparison of Solution Methods for Decision Processes with Non-Markovian Rewards
inferredcites →https://doi.org/10.48550/arxiv.1301.0606openalex-snapshot
Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards
inferredcites →https://doi.org/10.48550/arxiv.1301.6704openalex-snapshot
SPUDD: Stochastic Planning using Decision Diagrams
inferredcites →https://doi.org/10.48550/arxiv.1408.2027openalex-snapshot
A Heuristic Search Algorithm for Solving First-Order MDPs
inferredcites →https://doi.org/10.5555/777092.777164openalex-snapshot
Symbolic heuristic search for factored 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.2139/ssrn.4619459openalex-extracted
Using Experience Classification for Training Non-Markovian Tasks
inferred← citeshttps://doi.org/10.1007/978-3-030-93842-0_13openalex-snapshot
Regular Decision Processes for Grid Worlds
inferred← citeshttps://doi.org/10.1007/978-3-319-13560-1_2openalex-snapshot
A More Expressive Behavioral Logic for Decision-Theoretic Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-70169-1_12openalex-snapshot
Service Composition in Stochastic Settings
inferred← citeshttps://doi.org/10.1007/978-3-540-69937-8_23openalex-snapshot
Using α -ctl to Specify Complex Planning Goals
inferred← citeshttps://doi.org/10.1007/978-3-642-37807-2_32openalex-snapshot
Shortest Stochastic Path with Risk Sensitive Evaluation
inferred← citeshttps://doi.org/10.1007/s10817-022-09657-9openalex-snapshot
Optimal Deterministic Controller Synthesis from Steady-State Distributions
inferred← citeshttps://doi.org/10.1016/j.artint.2008.03.004openalex-snapshot
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.003openalex-snapshot
Practical solution techniques for first-order MDPs
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103431openalex-snapshot
An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104113openalex-snapshot
Regular decision processes
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104409openalex-snapshot
Planning for temporally extended goals in pure-past linear temporal logic
inferred← citeshttps://doi.org/10.1016/j.engappai.2014.09.020openalex-snapshot
Symbolic planning and control using game theory and grammatical inference
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.028openalex-snapshot
Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress)
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.124649openalex-snapshot
Using experience classification for training non-Markovian tasks
inferred← citeshttps://doi.org/10.1017/s0269964814000035openalex-snapshot
CHARACTERIZATIONS OF OPTIMAL POLICIES IN A GENERAL STOPPING PROBLEM AND STABILITY ESTIMATING
inferred← citeshttps://doi.org/10.1103/physrevresearch.4.013221openalex-snapshot
Neural ordinary differential equation control of dynamics on graphs
inferred← citeshttps://doi.org/10.1109/cdc.2015.7403398openalex-snapshot
Optimal control in Markov decision processes via distributed optimization
inferred← citeshttps://doi.org/10.1109/codit62066.2024.10708087openalex-snapshot
Design of Neuro-controllers for Nonlinear Continuous-time Systems using Evolutionary Algorithm*
inferred← citeshttps://doi.org/10.1109/devlrn.2011.6037340openalex-snapshot
Teaching and executing verb phrases
inferred← citeshttps://doi.org/10.1109/icalt.2016.99openalex-snapshot
Optimization of Personalized Learning Pathways Based on Competencies and Outcome
inferred← citeshttps://doi.org/10.1109/icpr48806.2021.9412601openalex-snapshot
Trajectory representation learning for Multi-Task NMRDP planning
inferred← citeshttps://doi.org/10.1109/iros.2007.4399403openalex-snapshot
Eliciting preferences over observed behaviours based on relative evaluations
inferred← citeshttps://doi.org/10.1109/iros.2008.4651133openalex-snapshot
The application of particle swarm optimization and maneuver automatons during non-Markovian motion planning for air vehicles performing ground target search
inferred← citeshttps://doi.org/10.1109/ro-man50785.2021.9515318openalex-snapshot
Maximizing Legibility in Stochastic Environments
inferred← citeshttps://doi.org/10.1109/services.2014.68openalex-snapshot
Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services
inferred← citeshttps://doi.org/10.1109/soca.2014.48openalex-snapshot
Applying Reinforcement Learning for Resolving Ambiguity in Service Composition
inferred← citeshttps://doi.org/10.1109/tpami.2024.3455257openalex-snapshot
Diversifying Policies With Non-Markov Dispersion to Expand the Solution Space
inferred← citeshttps://doi.org/10.1126/scirobotics.aay6276openalex-snapshot
A formal methods approach to interpretable reinforcement learning for robotic planning
inferred← citeshttps://doi.org/10.11606/t.45.2007.tde-09042008-105750openalex-snapshot
Planejamento sob incerteza para metas de alcançabilidade estendidas
inferred← citeshttps://doi.org/10.1186/s13174-015-0022-8openalex-snapshot
An approach towards adaptive service composition in markets of composed services
inferred← citeshttps://doi.org/10.1371/journal.pone.0263010openalex-snapshot
Personalized next-best action recommendation with multi-party interaction learning for automated decision-making
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9041openalex-snapshot
Saturated Path-Constrained MDP: Planning under Uncertainty and Deterministic Model-Checking Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11572openalex-snapshot
LTLf/LDLf Non-Markovian Rewards
inferred← citeshttps://doi.org/10.1609/aaai.v34i04.5814openalex-snapshot
Reinforcement Learning with Non-Markovian Rewards
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3549openalex-snapshot
Foundations for Restraining Bolts: Reinforcement Learning with LTLf/LDLf Restraining Specifications
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19853openalex-snapshot
Active Grammatical Inference for Non-Markovian Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19854openalex-snapshot
Multi-Agent Tree Search with Dynamic Reward Shaping
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18507openalex-snapshot
Guiding Search with Generalized Policies for Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/socs.v8i1.18421openalex-snapshot
Non-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping
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.1701openalex-snapshot
Engineering a Conformant Probabilistic Planner
inferred← citeshttps://doi.org/10.1613/jair.2529openalex-snapshot
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains
inferred← citeshttps://doi.org/10.2200/s00765ed1v01y201704aim034openalex-snapshot
Multi-Objective Decision Making
inferred← citeshttps://doi.org/10.24963/ijcai.2019/840openalex-snapshot
LTL and Beyond: Formal Languages for Reward Function Specification in Reinforcement Learning
inferred← citeshttps://doi.org/10.24963/ijcai.2020/690openalex-snapshot
Pure-Past Linear Temporal and Dynamic Logic on Finite Traces
inferred← citeshttps://doi.org/10.24963/kr.2020/89openalex-snapshot
Temporal Logic Monitoring Rewards via Transducers
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-881openalex-snapshot
LTL Goal Specifications Revisited
inferred← citeshttps://doi.org/10.3233/faia230247openalex-snapshot
Learning Task Automata for Reinforcement Learning Using Hidden Markov Models
inferred← citeshttps://doi.org/10.3233/faia230281openalex-snapshot
FOND Planning for Pure-Past Linear Temporal Logic Goals
inferred← citeshttps://doi.org/10.3929/ethz-b-000450528openalex-snapshot
NNC: Neural-Network Control of Dynamical Systems on Graphs
inferred← citeshttps://doi.org/10.4204/eptcs.326.11openalex-snapshot
LTLf Synthesis on Probabilistic Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1909.02940openalex-snapshot
Reinforcement Learning for Joint Optimization of Multiple Rewards
inferred← citeshttps://doi.org/10.5220/0010212000740086openalex-snapshot
Online Learning of non-Markovian Reward Models
inferred← citeshttps://doi.org/10.5220/0010898200003116openalex-snapshot
Learning Optimal Behavior in Environments with Non-stationary Observations
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94215openalex-snapshot
A methodological approach to policy refinement in policy-based management systems
inferred← citeshttps://doi.org/10.65109/fknq6967openalex-snapshot
Teaching Multiple Tasks to an RL Agent using LTL
inferred← citeshttps://doi.org/10.7250/9789934226748openalex-snapshot
Model-Oriented Control in Intelligent Manufacturing Systems
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.