Scribd
Upload
46 views20 pages

A Steric Algorithm

A* Search Algorithm is a pathfinding algorithm that efficiently plots a walkable path between nodes on a graph. It uses an admissible heuristic where the estimated cost is never an overestimate to guide the search. For example, it can find the shortest path between a starting node S and goal node G. The algorithm prefers expanding hypotheses closest to completion first. It allows pruning the search space risk-free to cut down options efficiently, though there is no guarantee of polynomial time completion. An admissible heuristic is required but may provide less realistic cost estimates.

Uploaded by

Rida Batool
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
46 views20 pages

A Steric Algorithm

A* Search Algorithm is a pathfinding algorithm that efficiently plots a walkable path between nodes on a graph. It uses an admissible heuristic where the estimated cost is never an overestimate to guide the search. For example, it can find the shortest path between a starting node S and goal node G. The algorithm prefers expanding hypotheses closest to completion first. It allows pruning the search space risk-free to cut down options efficiently, though there is no guarantee of polynomial time completion. An admissible heuristic is required but may provide less realistic cost estimates.

Uploaded by

Rida Batool
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

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!!

You might also like