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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:ad655cfe2e26 · see in the full table