A* Search Algorithm

MACHINE TRANSLATION
What is A* Search Algorithm?

 A* (pronounced as "A star") is a computer algorithm that is widely used in path

finding and graph traversal. The algorithm efficiently plots a walkable path
between multiple nodes, or points, on the graph.
Admissible heuristic

 A* search uses an admissible heuristic.

 An admissible heuristic requires that the estimated

cost is never an overestimate.
Example
Find the shortest path between node S and G
Search algorithm

 Depth first search algorithm

This algorithm prefers the expansion of

hypotheses that are closest to completion.
A* algorithm
Word decoding using A* algorithm
Strengths and Limitations

 A* search allows pruning of the search space that is risk

free, in other words, prevents search error.
 Efficient in cutting down the search space, but there is
no guarantee that it finishes in polynomial time.
 It requires an admissible heuristic, meaning a future
cost estimate that is never an underestimate. This may
lead to less realistic cost estimates.
 Any
Question???
Thank
you!!