On the public citation graph
Hierarchical Heuristic Search Revisited
0 signed · 42 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/3-540-45153-6_19openalex-snapshot
Searching for Nacro Operators with Automatically Generated Heuristics
inferredcites →https://doi.org/10.1007/978-3-642-17022-5_46openalex-snapshot
Solving the Sequential Ordering Problem with Automatically Generated Lower Bounds
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/s0166-218x(96)00069-8openalex-snapshot
Sorting with fixed-length reversals
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1613/jair.1480openalex-snapshot
Additive Pattern Database Heuristics
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-73580-9_29openalex-snapshot
Abstraction and Complexity Measures
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_5openalex-snapshot
Partial Pattern Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-74128-2_3openalex-snapshot
Automated Creation of Pattern Database Search Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_28openalex-snapshot
Active Learning of Group-Structured Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-21434-9_11openalex-snapshot
Learning Feature-Based Heuristic Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_8openalex-snapshot
Abstraction-Based Guided Search for Hybrid Systems
inferred← citeshttps://doi.org/10.1007/s10009-015-0393-yopenalex-snapshot
Guided search for hybrid systems based on coarse-grained space abstractions
inferred← citeshttps://doi.org/10.1016/j.artint.2006.09.002openalex-snapshot
Maximizing over multiple pattern databases speeds up heuristic search
inferred← citeshttps://doi.org/10.1016/j.artint.2011.08.001openalex-snapshot
Learning heuristic functions for large state spaces
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.12.022openalex-snapshot
Multiobjective heuristic search in road maps
inferred← citeshttps://doi.org/10.1016/j.ic.2009.09.001openalex-snapshot
Models of active learning in group-structured state spaces
inferred← citeshttps://doi.org/10.1109/innovations.2018.8606025openalex-snapshot
Dynamic Area Search with Shared Memory: A Meta-Framework to Improve Pathfinding Algorithms
inferred← citeshttps://doi.org/10.1109/iros.2009.5354804openalex-snapshot
FAHR: Focused A* Heuristic Recomputation
inferred← citeshttps://doi.org/10.1109/sbr-lars-r.2017.8215309openalex-snapshot
A hybrid approach to learn, retrieve and reuse qualitative cases
inferred← citeshttps://doi.org/10.1145/2141622.2141635openalex-snapshot
Real-time path planning for a robotic arm
inferred← citeshttps://doi.org/10.1145/2485895.2485909openalex-snapshot
Multi-domain real-time planning in dynamic environments
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7563openalex-snapshot
Searching Without a Heuristic: Efficient Use of Abstraction
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13436openalex-snapshot
Combined Task and Motion Planning for Mobile Manipulation
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18511openalex-snapshot
Interleaving Search and Heuristic Improvement
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18234openalex-snapshot
Multimapping Abstractions and Hierarchical Heuristic Search
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18356openalex-snapshot
The Spurious Path Problem in Abstraction
inferred← citeshttps://doi.org/10.1613/jair.2486openalex-snapshot
A General Theory of Additive State Space Abstractions
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-745openalex-snapshot
Relative-Order Abstractions for the Pancake Problem
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95561openalex-snapshot
Simulation, animation and rendering of crowds in real-time
inferred← citeshttps://doi.org/10.7939/r3668topenalex-snapshot
Cluster-and-Conquer: a Paradigm for Solving State-Space Problems
inferred← citeshttps://doi.org/10.7939/r3dw6topenalex-snapshot
Multimapping Abstraction and State-set Search Theory
inferred← citeshttps://doi.org/10.7939/r3q52fg8copenalex-snapshot
A General Additive Search Abstraction
inferred← citeshttps://doi.org/10.7939/r3qp6jopenalex-snapshot
Bootstrap Learning of Heuristic Functions
inferred← citeshttps://doi.org/10.82465/6593openalex-snapshot
Mutex Pair Detection for Improving Abstraction-based Heuristics
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.