On the public citation graph
New Islands of Tractability of Cost-Optimal Planning
0 signed · 53 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/b93903openalex-snapshot
Utilizing Problem Structure in Planning: A Local Search Approach
inferredcites →https://doi.org/10.1016/0004-3702(74)90026-5openalex-snapshot
Planning in a hierarchy of abstraction spaces
inferredcites →https://doi.org/10.1016/0004-3702(87)90092-0openalex-snapshot
Planning for conjunctive goals
inferredcites →https://doi.org/10.1016/0004-3702(94)00080-kopenalex-snapshot
Complexity, decidability and undecidability results for domain-independent planning
inferredcites →https://doi.org/10.1016/0004-3702(94)90062-0openalex-snapshot
Downward refinement and the efficiency of hierarchical problem solving
inferredcites →https://doi.org/10.1016/0004-3702(94)90069-8openalex-snapshot
Automatically generating abstractions for planning
inferredcites →https://doi.org/10.1016/0004-3702(94)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
inferredcites →https://doi.org/10.1016/b978-1-4832-1446-7.50040-6openalex-snapshot
GPS, A PROGRAM THAT SIMULATES HUMAN THOUGHT
inferredcites →https://doi.org/10.1016/b978-1-55860-137-6.50010-8openalex-snapshot
Abstraction in 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)00364-8openalex-snapshot
Complexity results for standard benchmark domains in planning
inferredcites →https://doi.org/10.1016/s0004-3702(98)00003-4openalex-snapshot
State-variable planning under structural restrictions: algorithms and complexity
inferredcites →https://doi.org/10.1016/s0954-1810(98)00009-0openalex-snapshot
Efficient planning for a miniature assembly line
inferredcites →https://doi.org/10.1023/a:1018995620232openalex-snapshot
Tractable plan existence does not imply tractable plan generation
inferredcites →https://doi.org/10.1111/j.1467-8640.1991.tb00393.xopenalex-snapshot
Planning in polynomial time: the SAS‐PUBS class
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferredcites →https://doi.org/10.1613/jair.1146openalex-snapshot
Structure and Complexity in Planning with Unary Operators
inferredcites →https://doi.org/10.1613/jair.1234openalex-snapshot
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
inferredcites →https://doi.org/10.1613/jair.1677openalex-snapshot
The Deterministic Part of IPC-4: An Overview
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.21236/ada269772openalex-snapshot
Automatically Generating Abstractions for Planning
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-10428-7_69openalex-snapshot
Monotone Temporal Planning: Tractability, Extensions and Applications
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.021openalex-snapshot
Optimal admissible composition of abstraction heuristics
inferred← citeshttps://doi.org/10.1016/j.artint.2011.12.002openalex-snapshot
The influence of k-dependence on the complexity of planning
inferred← citeshttps://doi.org/10.1016/j.artint.2012.08.005openalex-snapshot
On the complexity of planning for agent teams and its implications for single agent planning
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.004openalex-snapshot
Star-topology decoupled state space search
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8357openalex-snapshot
Structural Patterns Beyond Forks: Extending the Complexity Boundaries of Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8361openalex-snapshot
The Complexity of Planning Revisited — A Parameterized Analysis
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9025openalex-snapshot
Oversubscription Planning: Complexity and Compilability
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9648openalex-snapshot
Some Fixed Parameter Tractability Results for Planning with Non-Acyclic Domain-Transition Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9650openalex-snapshot
Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13349openalex-snapshot
The Influence of k-Dependence on the Complexity of Planning
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13501openalex-snapshot
Tractable Monotone Temporal Planning
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13550openalex-snapshot
When Acyclicity Is Not Enough: Limitations of the Causal Graph
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13804openalex-snapshot
The Two-Edged Nature of Diverse Action Costs
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19846openalex-snapshot
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators
inferred← citeshttps://doi.org/10.1609/socs.v16i1.27280openalex-snapshot
Generating SAS+ Planning Tasks of Specified Causal Structure
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18455openalex-snapshot
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs
inferred← citeshttps://doi.org/10.1613/jair.2891openalex-snapshot
The Role of Macros in Tractable Planning
inferred← citeshttps://doi.org/10.1613/jair.3276openalex-snapshot
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
inferred← citeshttps://doi.org/10.1613/jair.4145openalex-snapshot
The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph
inferred← citeshttps://doi.org/10.1613/jair.4358openalex-snapshot
Monotone Temporal Planning: Tractability, Extensions and Applications
inferred← citeshttps://doi.org/10.1613/jair.4586openalex-snapshot
BDD Ordering Heuristics for Classical Planning
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-33openalex-snapshot
Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs
inferred← citeshttps://doi.org/10.3233/aic-2011-0504openalex-snapshot
Implicit abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.3384/diss.diva-136280openalex-snapshot
Computational Complexity of some Optimization Problems in Planning
inferred← citeshttps://doi.org/10.3384/diss.diva-139802openalex-snapshot
Methods for Detecting Unsolvable Planning Instances using Variable Projection
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.