A Formal Basis for the Heuristic Determination of Minimum Cost Paths

https://doi.org/10.1109/TSSC.1968.300136

Introduces the A* search algorithm: nodes are expanded in order of path cost so far plus a heuristic estimate of remaining cost; with an admissible heuristic the first path found to the goal has minimum cost.

Agent pathfinding