On the public citation graph

A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains

0 signed · 31 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/0004-3702(87)90005-1openalex-snapshot
Admissibility of AO∗ when heuristics overestimate
inferredcites →https://doi.org/10.1016/0306-4573(85)90100-1openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving.
inferredcites →https://doi.org/10.1016/s0004-3702(00)00063-1openalex-snapshot
An efficient algorithm for searching implicit AND/OR graphs with cycles
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.1109/aero.2005.1559297openalex-snapshot
Mission planning and target tracking for autonomous instrument placement
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1184/r1/6561539.v1openalex-snapshot
Variable Resolution Discretization in Optimal Control
inferredcites →https://doi.org/10.1613/jair.1676openalex-snapshot
Decision-Theoretic Planning with non-Markovian Rewards
inferredcites →https://doi.org/10.1613/jair.2085openalex-snapshot
Solving Factored MDPs with Hybrid State and Action Variables
inferredcites →https://doi.org/10.1613/jair.575openalex-snapshot
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
inferredcites →https://doi.org/10.48550/arxiv.1207.4115openalex-snapshot
Dynamic Programming for Structured Continuous Markov Decision Problems
inferredcites →https://doi.org/10.48550/arxiv.1301.0559openalex-snapshot
Planning under Continuous Time and Resource Uncertainty: A Challenge for AI

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-319-23525-7_20openalex-snapshot
Planning in Discrete and Continuous Markov Decision Processes by Probabilistic Programming
inferred← citeshttps://doi.org/10.1007/s10458-010-9131-8openalex-snapshot
Planning in stochastic domains for multiple agents with individual continuous resource state-spaces
inferred← citeshttps://doi.org/10.1007/s10458-019-09423-zopenalex-snapshot
Probabilistic physical search on general graphs: approximations and heuristics
inferred← citeshttps://doi.org/10.1007/s10514-018-9703-zopenalex-snapshot
AMPLE: an anytime planning and execution framework for dynamic and uncertain problems in robotics
inferred← citeshttps://doi.org/10.1007/s10994-017-5669-xopenalex-snapshot
Planning in hybrid relational MDPs
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.04.014openalex-snapshot
Interactive planning and sensing in unknown static environments with task-driven sensor placement
inferred← citeshttps://doi.org/10.1109/bracis.2014.34openalex-snapshot
Continuous Real Time Dynamic Programming for Discrete and Continuous State MDPs
inferred← citeshttps://doi.org/10.1109/ictai.2017.00198openalex-snapshot
Resource-Based Dynamic Rewards for Factored MDPs
inferred← citeshttps://doi.org/10.1109/tmc.2021.3062575openalex-snapshot
MDLdroidLite: A Release-and-Inhibit Control Approach to Resource-Efficient Deep Neural Networks on Mobile Devices
inferred← citeshttps://doi.org/10.1142/s0218213015500256openalex-snapshot
Synthesis of Cost-Optimal Strong Plans in Non-Deterministic Domains
inferred← citeshttps://doi.org/10.1155/2014/753487openalex-snapshot
OL‐DEC‐MDP Model for Multiagent Online Scheduling with a Time‐Dependent Probability of Success
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.1177/0278364915595278openalex-snapshot
Online task planning and control for fuel-constrained aerial robots in wind fields
inferred← citeshttps://doi.org/10.2200/s00426ed1v01y201206aim017openalex-snapshot
Planning with Markov Decision Processes: An AI Perspective
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2013.04289openalex-snapshot
Conformant Planning Based on Reducing Belief States
inferred← citeshttps://doi.org/10.4018/978-1-60960-165-2.ch003openalex-snapshot
An Introduction to Fully and Partially Observable Markov Decision Processes
inferred← citeshttps://doi.org/10.4304/jcp.8.6.1385-1393openalex-snapshot
A Novel Heuristic Usage of Helpful Actions for Conformant-FF System
inferred← citeshttps://doi.org/10.70675/6824bcc7zd8cdz4dfcz995cz23276c57079eopenalex-snapshot
Decision-making algorithms for autonomous robots
inferred← citeshttps://doi.org/10.70675/7119356bzf2ebz48a0z88e8z63eea29bd4b7openalex-snapshot
Système délibératif d'un robot autonome : planification probabiliste hiérarchique basée sur des motivations et prise en compte de ressources
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.