On the public citation graph
Utilizing Problem Structure in Planning: A Local Search Approach
0 signed · 20 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/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
inferredcites →https://doi.org/10.1613/jair.445openalex-snapshot
When Gravity Fails: Local Search Topology
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.3224openalex-snapshot
Output error estimation strategies for discontinuous Galerkin discretizations of unsteady convection‐dominated flows
inferred← citeshttps://doi.org/10.1007/978-3-642-21501-8_29openalex-snapshot
Network Intrusion Prevention by Using Hierarchical Self-Organizing Maps and Probability-Based Labeling
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/s10472-009-9170-5openalex-snapshot
Set-structured and cost-sharing heuristics for classical planning
inferred← citeshttps://doi.org/10.1016/j.artint.2008.03.004openalex-snapshot
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
inferred← citeshttps://doi.org/10.1016/j.socnet.2025.07.007openalex-snapshot
Network interventions to improve search and facilitate research-practice transfer
inferred← citeshttps://doi.org/10.1109/tase.2010.2053534openalex-snapshot
Artificial Cognition in Production Systems
inferred← citeshttps://doi.org/10.11606/t.3.2016.tde-22072016-091845openalex-snapshot
Modelagem hierárquica e análise de requisitos de problemas reais em planejamento automático.
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13801openalex-snapshot
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15964openalex-snapshot
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions
inferred← citeshttps://doi.org/10.1613/jair.1.14034openalex-snapshot
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
inferred← citeshttps://doi.org/10.1613/jair.2498openalex-snapshot
New Islands of Tractability of Cost-Optimal 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.3233/aic-2011-0504openalex-snapshot
Implicit abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.4102/aosis.2020.bk179.02openalex-snapshot
Visual impairment in the global south
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.