AI engineering glossary · Data structures algorithms
What is a* search?
A* search (also called A star): A shortest-path search that guides exploration using f(n) = g(n) + h(n), where g is the cost so far and h is a heuristic estimate of the cost remaining. With an admissible heuristic that never overestimates, it finds an optimal path while exploring fewer nodes than Dijkstra.
A* search: an example
Navigation software can use straight-line distance to the destination as h, so it favours routes heading toward the goal.
Related terms
More Data structures algorithms terms
- Abstract data type
- Adjacency list
- Adjacency matrix
- Algorithm
- Amortized analysis
- Approximation algorithm
- Array
- AVL tree
Where you learn it
A* search is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.