On the public citation graph
Avoiding and Escaping Depressions in Real-Time Heuristic Search
0 signed · 79 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/978-1-4419-8188-2_1openalex-snapshot
Real-Time Heuristic Search for Pathfinding in Video Games
inferredcites →https://doi.org/10.1007/s10458-008-9061-xopenalex-snapshot
Comparing real-time and incremental heuristic search for real-time situated agents
inferredcites →https://doi.org/10.1016/0004-3702(90)90054-4openalex-snapshot
Real-time heuristic search
inferredcites →https://doi.org/10.1016/0004-3702(94)00011-oopenalex-snapshot
Learning to act using real-time dynamic programming
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/s0004-3702(03)00062-6openalex-snapshot
Performance bounds for planning in unknown terrain
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/70.182671openalex-snapshot
A mobile robot exploration algorithm
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/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1609/aiide.v7i1.12443openalex-snapshot
Ultra-Fast Optimal Pathfinding without Runtime Search
inferredcites →https://doi.org/10.1609/aiide.v7i1.12455openalex-snapshot
Real-Time Adaptive A∗ with Depression Avoidance
inferredcites →https://doi.org/10.1609/icaps.v20i1.13412openalex-snapshot
The Joy of Forgetting: Faster Anytime Search via Restarting
inferredcites →https://doi.org/10.1609/icaps.v21i1.13469openalex-snapshot
Where Ignoring Delete Lists Works, Part II: Causal Graphs
inferredcites →https://doi.org/10.1609/icaps.v21i1.13474openalex-snapshot
Learning Inadmissible Heuristics During Search
inferredcites →https://doi.org/10.1609/icaps.v21i1.13488openalex-snapshot
Fast Subgoaling for Pathfinding via Real-Time Search
inferredcites →https://doi.org/10.1609/socs.v1i1.18174openalex-snapshot
Real-Time Search in Dynamic Worlds
inferredcites →https://doi.org/10.1609/socs.v1i1.18182openalex-snapshot
A Comparison of Greedy Search Algorithms
inferredcites →https://doi.org/10.1609/socs.v2i1.18215openalex-snapshot
Real-Time Adaptive A* with Depression Avoidance
inferredcites →https://doi.org/10.1613/jair.1789openalex-snapshot
Learning in Real-Time Search: A Unifying Framework
inferredcites →https://doi.org/10.1613/jair.2497openalex-snapshot
Dynamic Control in Real-Time Heuristic Search
inferredcites →https://doi.org/10.1613/jair.3590openalex-snapshot
Avoiding and Escaping Depressions in Real-Time Heuristic Search
inferredcites →https://doi.org/10.48550/arxiv.1103.3687openalex-snapshot
Cost Based Satisficing Search Considered Harmful
inferredcites →https://doi.org/10.48550/arxiv.cs/0407016openalex-snapshot
Learning for Adaptive Real-time Search
inferredcites →https://doi.org/10.5555/1838206.1838253openalex-snapshot
On learning in agent-centered search
inferredcites →https://doi.org/10.5555/2034396.2034519openalex-snapshot
Escaping heuristic depressions in real-time heuristic search
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-070openalex-snapshot
Learning where you are going and from whence you came: h- and g-cost learning in real-time heuristic search
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-104openalex-snapshot
Real-time heuristic search with depression avoidance
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-319-12027-0_6openalex-snapshot
Real-Time Pathfinding in Unknown Terrain via Reconnection with an Ideal Tree
inferred← citeshttps://doi.org/10.1007/s10458-014-9266-0openalex-snapshot
Reusing cost-minimal paths for goal-directed navigation in partially known terrains
inferred← citeshttps://doi.org/10.1016/j.artint.2015.03.008openalex-snapshot
Incorporating weights into real-time heuristic search
inferred← citeshttps://doi.org/10.1016/j.cie.2026.111811openalex-snapshot
Simheuristics with metamodel initialization for determining repair system inventory policies
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.113217openalex-snapshot
GNM: GridCell navigational model
inferred← citeshttps://doi.org/10.1109/cig.2018.8490400openalex-snapshot
Anxious Learning in Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1109/cig.2018.8490436openalex-snapshot
Multi-Agent Pathfinding with Real-Time Heuristic Search
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/icra.2016.7487437openalex-snapshot
A*-Connect: Bounded suboptimal bidirectional heuristic search
inferred← citeshttps://doi.org/10.1109/isc251055.2020.9239065openalex-snapshot
Minimum Time Search in Unmanned Aerial Vehicles using Ant Colony Optimisation based Realistic Scenarios
inferred← citeshttps://doi.org/10.1111/coin.12092openalex-snapshot
An Empirical Comparison of Search Approaches for Moving Agents
inferred← citeshttps://doi.org/10.1111/itor.12196openalex-snapshot
An evolutionary implicit enumeration procedure for solving the resource‐constrained project scheduling problem
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.v28i1.8842openalex-snapshot
Exponential Deepening A* for Real-Time Agent-Centered Search
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11533openalex-snapshot
Avoiding Dead Ends in Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017578openalex-snapshot
Refining Abstraction Heuristics during Real-Time Planning
inferred← citeshttps://doi.org/10.1609/aaai.v34i03.5614openalex-snapshot
Envelope-Based Approaches to 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.v13i1.12927openalex-snapshot
Deep Learning for Real-Time Heuristic Search Algorithm Selection
inferred← citeshttps://doi.org/10.1609/aiide.v13i1.12943openalex-snapshot
Robustness of Real-Time Heuristic Search Algorithms to Read/Write Error in Externally Stored Heuristics
inferred← citeshttps://doi.org/10.1609/aiide.v13i2.12969openalex-snapshot
Effects of Self-Knowledge: Once Bitten Twice Shy
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13827openalex-snapshot
Planning Time to Think: Metareasoning for On-Line Planning with Durative Actions
inferred← citeshttps://doi.org/10.1609/socs.v18i1.35988openalex-snapshot
Real-time Cost-algebraic Heuristic Search
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18228openalex-snapshot
Paper Summary: Time-Bounded Adaptive A*
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.v4i1.18300openalex-snapshot
Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18305openalex-snapshot
Exponential Deepening A* for Real-Time Agent-Centered Search
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18325openalex-snapshot
Time-Bounded Best-First Search
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18331openalex-snapshot
Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18396openalex-snapshot
Weighted Lateral Learning in Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18410openalex-snapshot
Searching for Real-Time Heuristic Search Algorithms
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18468openalex-snapshot
A Neural Network for Decision Making in Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1613/jair.4292openalex-snapshot
Reconnection with the Ideal Tree: A New Approach to Real-Time 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.1613/jair.4908openalex-snapshot
Scrubbing During Learning In Real-time Heuristic Search
inferred← citeshttps://doi.org/10.1613/jair.5073openalex-snapshot
Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs
inferred← citeshttps://doi.org/10.24963/ijcai.2017/72openalex-snapshot
Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads
inferred← citeshttps://doi.org/10.24963/ijcai.2018/683openalex-snapshot
Online, Interactive User Guidance for High-dimensional, Constrained Motion Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08256openalex-snapshot
Evolving Real-Time Heuristics Search Algorithms with Building Blocks
inferred← citeshttps://doi.org/10.5555/2484920.2485012openalex-snapshot
Weighted real-time heuristic search
inferred← citeshttps://doi.org/10.5753/eniac.2022.227316openalex-snapshot
Semi-autonomous Planning: A novel approach for plan segmentation in multiagent planning
inferred← citeshttps://doi.org/10.7282/t3-8k6c-b717openalex-snapshot
Automated machine learning for supervised and unsupervised models with artificial neural networks
showing the first 46 of 47 · page through all 47
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.