On the public citation graph
Dynamic Control in Real-Time Heuristic Search
0 signed · 66 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-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-61291-2_68openalex-snapshot
Searching with pattern databases
inferredcites →https://doi.org/10.1007/978-3-540-73580-9_27openalex-snapshot
An Analysis of Map-Based Abstraction and Refinement
inferredcites →https://doi.org/10.1007/bf00993104openalex-snapshot
Prioritized Sweeping: Reinforcement Learning with Less Data and Less Time
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(84)90003-1openalex-snapshot
A heuristic search algorithm with modifiable estimate
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/0004-3702(90)90054-4openalex-snapshot
Real-time heuristic search
inferredcites →https://doi.org/10.1016/0004-3702(93)90045-dopenalex-snapshot
Linear-space best-first search
inferredcites →https://doi.org/10.1016/c2009-0-19715-5openalex-snapshot
Data Mining: Practical Machine Learning Tools and Techniques
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0004-3702(03)00012-2openalex-snapshot
Controlling the learning process of real-time heuristic search
inferredcites →https://doi.org/10.1016/s0020-0255(03)00045-8openalex-snapshot
Learning extension parameters in game-tree search
inferredcites →https://doi.org/10.1017/s0269888900007050openalex-snapshot
Do the right thing—studies in limited rationality by Stuart Russell and Eric Wefald, MIT Press, Cambridge, MA, £24.75, ISBN 0-262-18144-4.
inferredcites →https://doi.org/10.1109/34.42858openalex-snapshot
The history heuristic and alpha-beta search enhancements in practice
inferredcites →https://doi.org/10.1109/aamas.2004.7openalex-snapshot
A Comparison of Fast Search Methods for Real-Time Situated Agents
inferredcites →https://doi.org/10.1109/icsmc.1999.816643openalex-snapshot
RoboCup Rescue: search and rescue in large-scale disasters as a domain for autonomous agents research
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/aiide.v3i1.18778openalex-snapshot
Memory-Efficient Abstractions for Pathfinding
inferredcites →https://doi.org/10.1613/jair.2293openalex-snapshot
Graph Abstraction in Real-time Heuristic Search
inferredcites →https://doi.org/10.48550/arxiv.cs/0407016openalex-snapshot
Learning for Adaptive Real-time Search
inferredcites →https://doi.org/10.5860/choice.29-5169openalex-snapshot
Do the right thing: studies in limited rationality
inferredcites →https://doi.org/10.7916/d8hq46x1openalex-snapshot
Depth-First Iterative Deepening: An Optimal Admissible Tree Search
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-1-4419-8188-2_1openalex-snapshot
Real-Time Heuristic Search for Pathfinding in Video Games
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_11openalex-snapshot
Artificial Intelligence for Games
inferred← citeshttps://doi.org/10.1007/978-3-319-93527-0_6openalex-snapshot
CUBE System: A REST and RESTful Based Platform for Liquid Software Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-17432-2_41openalex-snapshot
Taking Learning Out of Real-Time Heuristic Search for Video-Game Pathfinding
inferred← citeshttps://doi.org/10.1007/978-3-642-38457-8_9openalex-snapshot
Fast Grid-Based Path Finding for Video Games
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.12.003openalex-snapshot
A new weighted pathfinding algorithms to reduce the search time on grid maps
inferred← citeshttps://doi.org/10.1080/0952813x.2010.545997openalex-snapshot
The pathology of heuristic search in the 8-puzzle
inferred← citeshttps://doi.org/10.1109/cog47356.2020.9231637openalex-snapshot
Evolving Initial Heuristic Functions for Agent-Centered Heuristic Search
inferred← citeshttps://doi.org/10.1109/cog57401.2023.10333175openalex-snapshot
Game-map Pathfinding with Per-Problem Selection of Synthesized Heuristics
inferred← citeshttps://doi.org/10.1109/icecco.2018.8634782openalex-snapshot
Influence of Heuristic Functions on Real-Time Heuristic Search Methods
inferred← citeshttps://doi.org/10.1109/icmlc.2011.6017018openalex-snapshot
KM-A∗ pathfinding algorithm based on hierarchical clustering and strengthened DB Index criteria
inferred← citeshttps://doi.org/10.1109/ictai.2011.20openalex-snapshot
Using a Goal-Agenda and Committed Actions in Real-Time Planning
inferred← citeshttps://doi.org/10.1109/tciaig.2010.2042449openalex-snapshot
Moving-Target Pursuit Algorithm Using Improved Tracking Strategy
inferred← citeshttps://doi.org/10.1109/tciaig.2012.2230632openalex-snapshot
Database-Driven Real-Time Heuristic Search in Video-Game Pathfinding
inferred← citeshttps://doi.org/10.1111/coin.12092openalex-snapshot
An Empirical Comparison of Search Approaches for Moving Agents
inferred← citeshttps://doi.org/10.1155/2017/1850678openalex-snapshot
Escaping Depressions in LRTS Based on Incremental Refinement of Encoded Quad‐Trees
inferred← citeshttps://doi.org/10.1162/978-0-262-33936-0-ch024openalex-snapshot
Evolving Real-time Heuristic Search Algorithms
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8060openalex-snapshot
Extending the Applications of Recent Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1609/aiide.v12i1.12882openalex-snapshot
Per-Map Algorithm Selection in Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1609/aiide.v13i2.12969openalex-snapshot
Effects of Self-Knowledge: Once Bitten Twice Shy
inferred← citeshttps://doi.org/10.1609/aiide.v4i1.18672openalex-snapshot
A Cover-Based Approach to Multi-Agent Moving Target Pursuit
inferred← citeshttps://doi.org/10.1609/aiide.v5i1.12349openalex-snapshot
kNN LRTA*: Simple Subgoaling for Real-Time Search
inferred← citeshttps://doi.org/10.1609/aiide.v8i1.12519openalex-snapshot
On Case Base Formation in Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13353openalex-snapshot
Thinking Ahead in Real-Time Search
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18169openalex-snapshot
Portal-Based True-Distance Heuristics for Path Finding
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18174openalex-snapshot
Real-Time Search in Dynamic Worlds
inferred← citeshttps://doi.org/10.1609/socs.v4i1.18283openalex-snapshot
Online Detection of Dead States in Real-Time Agent-Centered Search
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18396openalex-snapshot
Weighted Lateral Learning in Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1613/jair.3590openalex-snapshot
Avoiding and Escaping Depressions in Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1613/jair.4800openalex-snapshot
Achieving Goals Quickly Using Real-time Search: Experimental Results in Video Games
inferred← citeshttps://doi.org/10.3233/aic-170743openalex-snapshot
The compressed differential heuristic
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.687-691.1250openalex-snapshot
Research on Application of the Shortest Path in Game Based on an Improved Genetic Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.0912.3228openalex-snapshot
On Backtracking in Real-time Heuristic Search
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3233openalex-snapshot
Speeding Up Planning in Markov Decision Processes via Automatically Constructed Abstractions
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3309openalex-snapshot
Search-Space Characterization for Real-time Heuristic Search
inferred← citeshttps://doi.org/10.48550/arxiv.1810.09150openalex-snapshot
Mean-based Heuristic Search for Real-Time 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.