A Formal Basis for the Heuristic Determination of Minimum Cost Paths¶
Hart, P. E., Nilsson, & Raphael, B. (1968). A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Heuristic
- A* search in computer science. When finding the shortest path through a state space, A* uses a heuristic estimate h(n) of remaining cost to guide expansion; expand nodes in order of g(n) + h(n) (cost so far plus estimated cost to goal).
This sourceIntroduces the A* algorithm and formalizes admissible heuristics for optimal search; foundational in computer science.
- A* search in computer science. When finding the shortest path through a state space, A* uses a heuristic estimate h(n) of remaining cost to guide expansion; expand nodes in order of g(n) + h(n) (cost so far plus estimated cost to goal).
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:ad655cfe2e26 · see in the full table