On the public citation graph

Heuristic Search When Time Matters

0 signed · 58 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s10472-013-9347-9openalex-snapshot
Iterative-deepening search with on-line tree size prediction
inferredcites →https://doi.org/10.1016/0004-3702(70)90007-xopenalex-snapshot
Heuristic search viewed as path finding in a graph
inferredcites →https://doi.org/10.1016/0004-3702(90)90054-4openalex-snapshot
Real-time heuristic search
inferredcites →https://doi.org/10.1016/0012-365x(79)90068-2openalex-snapshot
Bounds for sorting by prefix reversal
inferredcites →https://doi.org/10.1016/s0004-3702(00)00068-0openalex-snapshot
Monitoring and control of anytime algorithms: A dynamic programming approach
inferredcites →https://doi.org/10.1016/s0004-3702(00)00072-2openalex-snapshot
Optimal schedules for monitoring anytime algorithms
inferredcites →https://doi.org/10.1016/s0004-3702(01)00094-7openalex-snapshot
Time complexity of iterative-deepening-A∗
inferredcites →https://doi.org/10.1016/s0065-2458(08)60520-3openalex-snapshot
The Algorithm Selection Problem
inferredcites →https://doi.org/10.1109/21.257749openalex-snapshot
Design-to-time real-time scheduling
inferredcites →https://doi.org/10.1109/proc.1981.12145openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1109/tciaig.2012.2197681openalex-snapshot
Benchmarks for Grid-Based Pathfinding
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.1137/0221022openalex-snapshot
Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
inferredcites →https://doi.org/10.1609/aaai.v24i1.7741openalex-snapshot
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13390openalex-snapshot
Using Distance Estimates in Heuristic Search
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.v20i1.13423openalex-snapshot
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms
inferredcites →https://doi.org/10.1609/icaps.v21i1.13474openalex-snapshot
Learning Inadmissible Heuristics During Search
inferredcites →https://doi.org/10.1609/socs.v1i1.18151openalex-snapshot
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms
inferredcites →https://doi.org/10.1609/socs.v1i1.18176openalex-snapshot
Landmark Heuristics for the Pancake Problem
inferredcites →https://doi.org/10.1609/socs.v1i1.18181openalex-snapshot
Anytime Heuristic Search: Frameworks and Algorithms
inferredcites →https://doi.org/10.1609/socs.v2i1.18199openalex-snapshot
Deadline-Aware Search Using On-Line Measures of Behavior
inferredcites →https://doi.org/10.1609/socs.v2i1.18218openalex-snapshot
Distance Learning in Agent-Centered Heuristic Search
inferredcites →https://doi.org/10.1609/socs.v3i1.18242openalex-snapshot
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions
inferredcites →https://doi.org/10.1609/socs.v3i1.18245openalex-snapshot
Implementing Fast Heuristic Search Code
inferredcites →https://doi.org/10.1613/jair.2096openalex-snapshot
Anytime Heuristic Search
inferredcites →https://doi.org/10.21236/ada459660openalex-snapshot
A Mobile Automaton: An Application of Artificial Intelligence Techniques
inferredcites →https://doi.org/10.2307/2005469openalex-snapshot
Estimating the Efficiency of Backtrack Programs
inferredcites →https://doi.org/10.48550/arxiv.1104.1924openalex-snapshot
Rational Deployment of CSP Heuristics
inferredcites →https://doi.org/10.48550/arxiv.1301.2279openalex-snapshot
A Bayesian Approach to Tackling Hard Computational Problems
inferredcites →https://doi.org/10.5860/choice.29-5169openalex-snapshot
Do the right thing: studies in limited rationality

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-030-94628-9_28openalex-snapshot
Fast Retargetable Goals Driven Approach to Deal with Plan Failures of Spacecraft
inferred← citeshttps://doi.org/10.1007/s10514-018-9703-zopenalex-snapshot
AMPLE: an anytime planning and execution framework for dynamic and uncertain problems in robotics
inferred← citeshttps://doi.org/10.1016/j.artint.2017.11.001openalex-snapshot
Rational deployment of multiple heuristics in optimal state-space search
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.08.030openalex-snapshot
Automatically discovering clusters of algorithm and problem instance behaviors as well as their causes from experimental data, algorithm setups, and instance features
inferred← citeshttps://doi.org/10.1109/icccr56747.2023.10193943openalex-snapshot
Realtime Mask Detection of Kitchen Staff Using YOLOv5 and Edge Computing
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/icra40945.2020.9196898openalex-snapshot
A Model-Free Approach to Meta-Level Control of Anytime Algorithms
inferred← citeshttps://doi.org/10.1109/lra.2020.2972820openalex-snapshot
Fast Planning Over Roadmaps via Selective Densification
inferred← citeshttps://doi.org/10.1126/science.aac6076openalex-snapshot
Computational rationality: A converging paradigm for intelligence in brains, minds, and machines
inferred← citeshttps://doi.org/10.1162/neco_a_01153openalex-snapshot
Systems of Bounded Rational Agents with Information-Theoretic Constraints
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.v35i14.17461openalex-snapshot
Choosing the Initial State for Online Replanning
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.29983openalex-snapshot
Stop! Planner Time: Metareasoning for Probabilistic Planning Using Learned Performance Profiles
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.30063openalex-snapshot
Rectangle Search: An Anytime Beam Search
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13692openalex-snapshot
An Online Replanning Approach for Crop Fields Mapping with Autonomous UAVs
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13878openalex-snapshot
Temporal Planning while the Clock Ticks
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19805openalex-snapshot
Beam Search: Faster and Monotonic
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19842openalex-snapshot
Tuning the Hyperparameters of Anytime Planning: A Metareasoning Approach with Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18476openalex-snapshot
Improved Safe Real-Time Heuristic Search
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18362openalex-snapshot
Metareasoning 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.1613/jair.5073openalex-snapshot
Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs
inferred← citeshttps://doi.org/10.24963/ijcai.2020/577openalex-snapshot
Trading Plan Cost for Timeliness in Situated Temporal Planning
inferred← citeshttps://doi.org/10.3389/frobt.2015.00027openalex-snapshot
Bounded Rationality, Abstraction, and Hierarchical Decision-Making: An Information-Theoretic Optimality Principle
inferred← citeshttps://doi.org/10.3390/aerospace9010040openalex-snapshot
Autonomous Recovery from Spacecraft Plan Failures by Regulatory Repair While Retaining Operability
inferred← citeshttps://doi.org/10.3390/e21040375openalex-snapshot
Bounded Rational Decision-Making from Elementary Computations That Reduce Uncertainty
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00399openalex-snapshot
Metareasoning for Planning Under Uncertainty
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.