On the public citation graph
The Role of Macros in Tractable Planning
0 signed · 44 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.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/0004-3702(87)90051-8openalex-snapshot
Planning as search: A quantitative approach
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)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/j.jcss.2009.10.013openalex-snapshot
Causal graphs and structurally restricted 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.1023/a:1018995620232openalex-snapshot
Tractable plan existence does not imply tractable plan generation
inferredcites →https://doi.org/10.1613/jair.1146openalex-snapshot
Structure and Complexity in Planning with Unary Operators
inferredcites →https://doi.org/10.1613/jair.1696openalex-snapshot
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators
inferredcites →https://doi.org/10.1613/jair.2432openalex-snapshot
The Complexity of Planning Problems With Simple Causal Graphs
inferredcites →https://doi.org/10.1613/jair.2498openalex-snapshot
New Islands of Tractability of Cost-Optimal Planning
inferredcites →https://doi.org/10.1613/jair.2742openalex-snapshot
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard
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.1007/978-3-319-33509-4_2openalex-snapshot
From Public Plans to Global Solutions in Multiagent Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-78301-7_4openalex-snapshot
Recursive Reductions of Action Dependencies for Coordination-Based Multiagent Planning
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.2014.02.002openalex-snapshot
Limitations of acyclic causal graphs for planning
inferred← citeshttps://doi.org/10.1016/j.artint.2018.10.006openalex-snapshot
Computing programs for generalized planning using a classical planner
inferred← citeshttps://doi.org/10.1017/s0269888918000231openalex-snapshot
A review of generalized planning
inferred← citeshttps://doi.org/10.1109/icaipr.2016.7585227openalex-snapshot
Mining useful macro-actions in planning
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/icaps.v21i1.13446openalex-snapshot
Limits for Compact Representation of Plans
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.v26i1.13735openalex-snapshot
Generalized Planning with Procedural Domain Control Knowledge
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13749openalex-snapshot
Recursive Polynomial Reductions for Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19786openalex-snapshot
Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31471openalex-snapshot
Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity
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.3534openalex-snapshot
Algorithms and Limits for Compact Plan Representations
inferred← citeshttps://doi.org/10.1613/jair.4358openalex-snapshot
Monotone Temporal Planning: Tractability, Extensions and Applications
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-85openalex-snapshot
Macros, Reactive Plans and Compact Representations
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-91openalex-snapshot
From Macro Plans to Automata Plans
inferred← citeshttps://doi.org/10.3233/aic-150679openalex-snapshot
On the completeness of replacing primitive actions with macro-actions and its generalization to planning operators and macro-operators
inferred← citeshttps://doi.org/10.48550/arxiv.1206.6473openalex-snapshot
Compositional Planning Using Optimal Option Models
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02293openalex-snapshot
Learning Macro-actions for State-Space Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1810.09145openalex-snapshot
Mining useful Macro-actions in Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1910.04999openalex-snapshot
Generalized Planning With Procedural Domain Control Knowledge
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-340openalex-snapshot
Bounded intention planning
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.