On the public citation graph
Tie-Breaking Strategies for Cost-Optimal Best First Search
0 signed · 57 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/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0004-3702(86)90035-4openalex-snapshot
Depth-first iterative-deepening: An optimal admissible tree search
inferredcites →https://doi.org/10.1016/0377-2217(85)90047-5openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving
inferredcites →https://doi.org/10.1016/j.artint.2007.11.009openalex-snapshot
Anytime search in dynamic graphs
inferredcites →https://doi.org/10.1016/j.artint.2011.02.001openalex-snapshot
Inconsistent heuristics in theory and practice
inferredcites →https://doi.org/10.1016/s0305-0548(98)80001-4openalex-snapshot
Applications of modern heuristic search methods to pattern sequencing problems
inferredcites →https://doi.org/10.1016/s0736-5853(86)80081-8openalex-snapshot
Heuristics: Intelligent Search Strategies for Computer Problem Solving
inferredcites →https://doi.org/10.1109/tpami.1982.4767270openalex-snapshot
Studies in Semi-Admissible Heuristics
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.1145/3544585.3544600openalex-snapshot
A Note on Two Problems in Connexion with Graphs
inferredcites →https://doi.org/10.1609/aaai.v24i1.7559openalex-snapshot
Using Lookaheads with Optimal Best-First Search
inferredcites →https://doi.org/10.1609/aaai.v25i1.8004openalex-snapshot
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning
inferredcites →https://doi.org/10.1609/aaai.v25i1.8014openalex-snapshot
Exploiting Problem Symmetries in State-Based Planners
inferredcites →https://doi.org/10.1609/aaai.v28i1.9036openalex-snapshot
Type-Based Exploration with Multiple Search Queues for Satisficing Planning
inferredcites →https://doi.org/10.1609/aaai.v29i1.9647openalex-snapshot
Multi-Objective MDPs with Conditional Lexicographic Reward Preferences
inferredcites →https://doi.org/10.1609/aaai.v30i1.10081openalex-snapshot
On the Completeness of Best-First Search Variants That Use Random Exploration
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
inferredcites →https://doi.org/10.1609/icaps.v19i1.13373openalex-snapshot
Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13386openalex-snapshot
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
inferredcites →https://doi.org/10.1609/icaps.v19i1.13390openalex-snapshot
Using Distance Estimates in Heuristic Search
inferredcites →https://doi.org/10.1609/icaps.v20i1.13396openalex-snapshot
G-Value Plateaus: A Challenge for Planning
inferredcites →https://doi.org/10.1609/icaps.v20i1.13435openalex-snapshot
The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning
inferredcites →https://doi.org/10.1609/icaps.v23i1.13562openalex-snapshot
Faster Optimal Planning with Partial-Order Pruning
inferredcites →https://doi.org/10.1609/icaps.v23i1.13565openalex-snapshot
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core
inferredcites →https://doi.org/10.1609/icaps.v23i1.13595openalex-snapshot
Symmetry Breaking: Satisficing Planning and Landmark Heuristics
inferredcites →https://doi.org/10.1609/icaps.v24i1.13681openalex-snapshot
A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration
inferredcites →https://doi.org/10.1609/icaps.v25i1.13703openalex-snapshot
Solving Large-Scale Planning Problems by Decomposition and Macro Generation
inferredcites →https://doi.org/10.1609/icaps.v26i1.13738openalex-snapshot
A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning
inferredcites →https://doi.org/10.1609/socs.v1i1.18160openalex-snapshot
Common Misconceptions Concerning Heuristic Search
inferredcites →https://doi.org/10.1609/socs.v1i1.18178openalex-snapshot
Cost Based Search Considered Harmful
inferredcites →https://doi.org/10.1609/socs.v2i1.18202openalex-snapshot
Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs
inferredcites →https://doi.org/10.1609/socs.v2i1.18208openalex-snapshot
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning
inferredcites →https://doi.org/10.1609/socs.v3i1.18245openalex-snapshot
Implementing Fast Heuristic Search Code
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.1698openalex-snapshot
Optiplan: Unifying IP-based and Graph-based Planning
inferredcites →https://doi.org/10.1613/jair.3276openalex-snapshot
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
inferredcites →https://doi.org/10.1613/jair.544openalex-snapshot
The Automatic Inference of State Invariants in TIM
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-119openalex-snapshot
Bounded suboptimal search: a direct approach using inadmissible estimates
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.5167openalex-snapshot
Multi‐resource workload mapping with minimum cost in cloud environment
inferred← citeshttps://doi.org/10.1007/s10472-021-09775-xopenalex-snapshot
Heuristic search for one-to-many shortest path queries
inferred← citeshttps://doi.org/10.1080/17538947.2018.1429503openalex-snapshot
Efficient Priority-Flood depression filling in raster digital elevation models
inferred← citeshttps://doi.org/10.1109/ictai50040.2020.00025openalex-snapshot
Configurable Heuristic Adaptation for Improving Best First Search in AI Planning
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11526openalex-snapshot
Revisiting Immediate Duplicate Detection in External Memory Search
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17426openalex-snapshot
On the Optimal Efficiency of A* with Dominance Pruning
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13800openalex-snapshot
Exploration among and within Plateaus in Greedy Best-First Search
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13804openalex-snapshot
The Two-Edged Nature of Diverse Action Costs
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6659openalex-snapshot
Analyzing and Avoiding Pathological Behavior in Parallel Best-First Search
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19846openalex-snapshot
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators
inferred← citeshttps://doi.org/10.1609/socs.v8i1.18425openalex-snapshot
Understanding the Search Behaviour of Greedy Best-First Search
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18462openalex-snapshot
Position Paper: Using Early Goal Test in A*
inferred← citeshttps://doi.org/10.3233/faia230340openalex-snapshot
Scaling-Up LAO* in FOND Planning: An Ablation Study
inferred← citeshttps://doi.org/10.5753/reic.2018.1057openalex-snapshot
Domain-Dependent Heuristics and Tie-Breakers: Topics in Automated 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.