On the public citation graph
Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks
0 signed · 48 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/10720246_27openalex-snapshot
GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables
inferredcites →https://doi.org/10.1007/3-540-39963-1_23openalex-snapshot
A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm
inferredcites →https://doi.org/10.1007/3-540-45329-6_38openalex-snapshot
SimPlanner: An Execution-Monitoring System for Replanning in Dynamic Worlds
inferredcites →https://doi.org/10.1007/3-540-45329-6_40openalex-snapshot
STeLLa: An Optimal Sequential and Parallel Planner
inferredcites →https://doi.org/10.1007/3-540-63912-8_97openalex-snapshot
Ignoring irrelevant facts and operators in plan generation
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/s0004-3702(02)00364-8openalex-snapshot
Complexity results for standard benchmark domains in planning
inferredcites →https://doi.org/10.1016/s0004-3702(99)00010-7openalex-snapshot
Using regression-match graphs to control search in planning
inferredcites →https://doi.org/10.1609/aimag.v22i3.1574openalex-snapshot
MIPS: The Model-Checking Integrated Planning System
inferredcites →https://doi.org/10.1609/aimag.v22i3.1579openalex-snapshot
AltAlt: Combining Graphplan and Heuristic State Search
inferredcites →https://doi.org/10.1613/jair.1240openalex-snapshot
The 3rd International Planning Competition: Results and Analysis
inferredcites →https://doi.org/10.1613/jair.1982openalex-snapshot
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
inferredcites →https://doi.org/10.1613/jair.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.1613/jair.893openalex-snapshot
The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning
inferredcites →https://doi.org/10.48550/arxiv.1107.0025openalex-snapshot
Taming Numbers and Durations in the Model Checking Integrated Planning System
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-540-74970-7_46openalex-snapshot
An LP-Based Heuristic for Optimal Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-04617-9_2openalex-snapshot
Planning with h + in Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-24455-1_1openalex-snapshot
Everything You Always Wanted to Know about Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-25324-9_30openalex-snapshot
Content Determination through Planning for Flexible Game Tutorials
inferred← citeshttps://doi.org/10.1007/s10458-016-9333-9openalex-snapshot
Collaborative privacy preserving multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10472-009-9170-5openalex-snapshot
Set-structured and cost-sharing heuristics for classical planning
inferred← citeshttps://doi.org/10.1007/s10489-012-0404-6openalex-snapshot
A case-based approach to heuristic planning
inferred← citeshttps://doi.org/10.1007/s11128-014-0892-xopenalex-snapshot
A case study in programming a quantum annealer for hard operational planning problems
inferred← citeshttps://doi.org/10.1007/s11227-018-2627-8openalex-snapshot
A new goal ordering for incremental planning
inferred← citeshttps://doi.org/10.1007/s11704-007-0004-5openalex-snapshot
Recognizing the agent’s goals incrementally: planning graph as a basis
inferred← citeshttps://doi.org/10.1016/j.artint.2008.10.013openalex-snapshot
Concise finite-domain representations for PDDL planning tasks
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
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.artint.2015.01.004openalex-snapshot
The deterministic part of the seventh International Planning Competition
inferred← citeshttps://doi.org/10.1016/j.artint.2016.12.002openalex-snapshot
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103608openalex-snapshot
A framework for analysing state-abstraction methods
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.122820openalex-snapshot
A hybrid approach for expressive numeric and temporal planning with control parameters
inferred← citeshttps://doi.org/10.1017/s1471068422000072openalex-snapshot
Answer Set Planning: A Survey
inferred← citeshttps://doi.org/10.1080/0952813x.2010.503341openalex-snapshot
On the importance of breaking ties in the relaxed plan heuristic
inferred← citeshttps://doi.org/10.1080/0952813x.2014.993506openalex-snapshot
Effective plan retrieval in case-based planning for metric-temporal problems
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9030141openalex-snapshot
Incremental Abstraction Computation for Symbolic Controller Synthesis in a Changing Environment
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5362668openalex-snapshot
Ordered Hill Climbing Search for Heuristic Planning
inferred← citeshttps://doi.org/10.1109/icnc.2007.464openalex-snapshot
Making FF Faster in ADL Domains
inferred← citeshttps://doi.org/10.1111/coin.12019openalex-snapshot
Planning with Multistep Forward Search with Forced Goal‐Ordering Constraints
inferred← citeshttps://doi.org/10.1142/s0218213007003515openalex-snapshot
SUBGOAL ORDERING AND GRANULARITY CONTROL FOR INCREMENTAL PLANNING
inferred← citeshttps://doi.org/10.1155/2013/963874openalex-snapshot
Heuristic Search for Planning with Different Forced Goal‐Ordering Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17461openalex-snapshot
Choosing the Initial State for Online Replanning
inferred← citeshttps://doi.org/10.2200/s01152ed1v01y202111aim050openalex-snapshot
Explainable Human--AI Interaction: A Planning Perspective
inferred← citeshttps://doi.org/10.32920/25190978openalex-snapshot
Heuristic Planning for Continuous Systems in Hybrid Temporal Situation Calculus
inferred← citeshttps://doi.org/10.32920/25190978.v1openalex-snapshot
Heuristic Planning for Continuous Systems in Hybrid Temporal Situation Calculus
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.219-220.1683openalex-snapshot
OHCP: A Local Search Planner Based on Ordered Hill Climbing Algorithm and Local-Minimal Restart Strategy
inferred← citeshttps://doi.org/10.4304/jsw.7.9.2099-2106openalex-snapshot
A Survey of Heuristics for Domain-Independent 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.