On the public citation graph
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
0 signed · 38 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(70)90007-xopenalex-snapshot
Heuristic search viewed as path finding in a graph
inferredcites →https://doi.org/10.1016/j.artint.2008.01.002openalex-snapshot
An approach to efficient planning with numerical fluents and multi-criteria plan quality
inferredcites →https://doi.org/10.1184/r1/6607754openalex-snapshot
Nonlinear Planning with Parallel Resource Allocation
inferredcites →https://doi.org/10.1613/jair.477openalex-snapshot
Computational Aspects of Reordering Plans
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.7939/r3fm9hopenalex-snapshot
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement - Extended Version
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-030-28619-4_58openalex-snapshot
Fast Action Elimination for Efficient Decision Making and Belief Space Planning Using Bounded Approximations
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferred← citeshttps://doi.org/10.1016/j.engappai.2013.04.006openalex-snapshot
Post-design analysis for building and refining AI planning systems
inferred← citeshttps://doi.org/10.1017/s0269888918000012openalex-snapshot
What you always wanted to know about the deterministic part of the International Planning Competition (IPC) 2014 (but were too afraid to ask)
inferred← citeshttps://doi.org/10.1109/ictai.2012.72openalex-snapshot
Determining Redundant Actions in Sequential Plans
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8039openalex-snapshot
A Local Monte Carlo Tree Search Approach in Deterministic Planning
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6530openalex-snapshot
POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.30000openalex-snapshot
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13502openalex-snapshot
Planning Via Random Walk-Driven Local Search
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13536openalex-snapshot
Optimizing Plans through Analysis of Action Dependencies and Independencies
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13543openalex-snapshot
Better Time Constrained Search via Randomization and Postprocessing
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13770openalex-snapshot
A Formal Analysis of Required Cooperation in Multi-Agent Planning
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3493openalex-snapshot
Eliminating Redundant Actions in Partially Ordered Plans — A Complexity Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19808openalex-snapshot
On Speeding Up Methods for Identifying Redundant Actions in Plans
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19820openalex-snapshot
Debugging a Policy: Automatic Action-Policy Testing in AI Planning
inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27185openalex-snapshot
Automatic Metamorphic Test Oracles for Action-Policy Testing
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18318openalex-snapshot
On Different Strategies for Eliminating Redundant Actions from Plans
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18373openalex-snapshot
A Preliminary Selection of Problems in Heuristic Search
inferred← citeshttps://doi.org/10.1613/jair.4231openalex-snapshot
Property Directed Reachability for Automated Planning
inferred← citeshttps://doi.org/10.1613/jair.4980openalex-snapshot
Continuing Plan Quality Optimisation
inferred← citeshttps://doi.org/10.22028/d291-26627openalex-snapshot
Resolution-based methods for linear temporal reasoning
inferred← citeshttps://doi.org/10.24963/kr.2023/80openalex-snapshot
Eliminating Redundant Actions from Plans Using Classical Planning
inferred← citeshttps://doi.org/10.25911/5d6c3a9454f26openalex-snapshot
Using Plan Decomposition for Continuing Plan Optimisation and Macro Generation
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-786openalex-snapshot
ArvandHerd: Parallel Planning with a Portfolio
inferred← citeshttps://doi.org/10.3233/aic-150680openalex-snapshot
Optimizing individual activity personal plans through local search
inferred← citeshttps://doi.org/10.48550/arxiv.1608.01302openalex-snapshot
Learning to Rank for Synthesizing Planning Heuristics
inferred← citeshttps://doi.org/10.7939/r3896qopenalex-snapshot
Random Walk Planning: Theory, Practice, and Application
inferred← citeshttps://doi.org/10.7939/r3mc8rn1copenalex-snapshot
Exploration in Greedy Best-First Search for Satisficing 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.