On the public citation graph

Multi-Heuristic A*

0 signed · 44 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.1016/0004-3702(70)90007-xopenalex-snapshot
Heuristic search viewed as path finding in a graph
inferredcites →https://doi.org/10.1016/0020-0190(89)90171-3openalex-snapshot
Increasing search efficiency using multiple heuristics
inferredcites →https://doi.org/10.1016/0020-0255(92)90009-wopenalex-snapshot
Generalized best first search using single and multiple heuristics
inferredcites →https://doi.org/10.1016/0306-4573(85)90100-1openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving.
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/s0004-3702(01)00092-3openalex-snapshot
Disjoint pattern database heuristics
inferredcites →https://doi.org/10.1109/70.508439openalex-snapshot
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
inferredcites →https://doi.org/10.1109/icra.2012.6225008openalex-snapshot
Search-based planning for dual-arm manipulation with upright orientation constraints
inferredcites →https://doi.org/10.1109/icra.2013.6631131openalex-snapshot
Path planning for non-circular micro aerial vehicles in constrained environments
inferredcites →https://doi.org/10.1109/mra.2012.2205651openalex-snapshot
The Open Motion Planning Library
inferredcites →https://doi.org/10.1109/robot.2000.844730openalex-snapshot
RRT-connect: An efficient approach to single-query path planning
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.1177/0278364909340445openalex-snapshot
Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles
inferredcites →https://doi.org/10.1177/0278364910392608openalex-snapshot
Optimization and learning for rough terrain legged locomotion
inferredcites →https://doi.org/10.1177/0278364913507983openalex-snapshot
Single- and dual-arm motion planning with heuristic search
inferredcites →https://doi.org/10.1201/9781439864135-43openalex-snapshot
Rapidly-Exploring Random Trees: Progress and Prospects
inferredcites →https://doi.org/10.15607/rss.2010.vi.034openalex-snapshot
Incremental Sampling-based Algorithms for Optimal Motion Planning
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.v20i1.13435openalex-snapshot
The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning
inferredcites →https://doi.org/10.1609/icaps.v22i1.13514openalex-snapshot
Faster Bounded-Cost Search Using Inadmissible Estimates
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.1613/jair.1480openalex-snapshot
Additive Pattern Database Heuristics
inferredcites →https://doi.org/10.1613/jair.3590openalex-snapshot
Avoiding and Escaping Depressions in Real-Time Heuristic Search
inferredcites →https://doi.org/10.5555/777092.777250openalex-snapshot
Multiple sequence alignment using anytime A
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-119openalex-snapshot
Bounded suboptimal search: a direct approach using inadmissible estimates
inferredcites →https://doi.org/10.7551/mitpress/9123.003.0038openalex-snapshot
Incremental Sampling-based Algorithms for Optimal Motion Planning

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-36178-5_25openalex-snapshot
Safe Map Routing Using Heuristic Algorithm Based on Regional Crime Rates
inferred← citeshttps://doi.org/10.1007/s10514-015-9440-5openalex-snapshot
Learning to plan for constrained manipulation from demonstrations
inferred← citeshttps://doi.org/10.1109/cog47356.2020.9231929openalex-snapshot
The FESS Algorithm: A Feature Based Approach to Single-Agent Search
inferred← citeshttps://doi.org/10.1109/icra.2015.7139515openalex-snapshot
Dynamic Multi-Heuristic A*
inferred← citeshttps://doi.org/10.1109/icra.2015.7139954openalex-snapshot
Planning for multi-agent teams with leader switching
inferred← citeshttps://doi.org/10.1109/icra.2016.7487136openalex-snapshot
List prediction applied to motion planning
inferred← citeshttps://doi.org/10.1109/icra.2016.7487437openalex-snapshot
A*-Connect: Bounded suboptimal bidirectional heuristic search
inferred← citeshttps://doi.org/10.1109/icra.2016.7487711openalex-snapshot
PERCH: Perception via search for multi-object recognition and localization
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197015openalex-snapshot
Learning Heuristic A: Efficient Graph Search using Neural Network
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561928openalex-snapshot
Fast Replanning Multi-Heuristic A
inferred← citeshttps://doi.org/10.1109/iros.2015.7354040openalex-snapshot
Path planning for a tethered robot using Multi-Heuristic A* with topology-based heuristics
inferred← citeshttps://doi.org/10.1109/iros.2016.7759442openalex-snapshot
Contingency planning for automated vehicles
inferred← citeshttps://doi.org/10.1109/tii.2022.3188359openalex-snapshot
Reinforcement Learning Heuristic A*
inferred← citeshttps://doi.org/10.1109/vtc2025-fall65116.2025.11310335openalex-snapshot
Hierarchical Reinforcement Learning A* for Path Planning
inferred← citeshttps://doi.org/10.1177/0278364915594029openalex-snapshot
Multi-Heuristic A*
inferred← citeshttps://doi.org/10.23919/acc.2018.8430678openalex-snapshot
A virtual bug planning technique for 2D robot path planning
inferred← citeshttps://doi.org/10.2514/6.2016-0254openalex-snapshot
BugFlood: A bug inspired algorithm for efficient path planning in an obstacle rich environment
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.