A* Search Algorithm
OR
A* Algorithm in Artificial Intelligence
You Must Know in 2022 Because Artificial Intelligence is an essential topic
In only a few minutes, you will understand the A* Search Algorithm in simple terms.
So, let's get started. If you enjoy this and find the information beneficial, please like and share it with your friends.
2. SEARCH ALGORITHMS
•Moving from one place to another is a task
we do everyday
•Finding the shortest path by our self was
difficult
•We now have algorithms that help us find the
shortest path
4. WHAT IS A* ALGORITHM
A * algorithm is a
searching algorithm that
searches for the shortest
path between the initial
and the final state
USED
Path finding
Graph traversal
Used to calculate the
shortest distance
between the source
(initial state) and the
destination (final state).
5. OPTIMAL
A* is sure to give
you the best solution
that is available for
the problem
COMPLETE
A* is to find all the
possible solutions
that exists for the
problem
6. f(n) = g(n) + h(n)
Estimated
cost of
cheapest
solution
Cost to reach
node n from
start state
Cost to reach
from node n
to goal node
7. Why A* Algorithm?
Dijkstra does not know when to
stop as it does not know which is
the best path and tends to
compute inefficiently
A* computes the best possible
way and stops when the best rout
is found. This makes the
computation efficient and
effective
8. PROS
• A* algorithm is the best algorithm
than other search algorithms.
• A* algorithm is optimal and
complete.
• This algorithm can solve very
complex problems.
CONS
• It does not always produce the
shortest path as it mostly based on
heuristics and approximation.
• A* algorithm has some complexity
issues.
• The main drawback of A* is memory
requirement as it keeps all
generated nodes in the memory, so
it is not practical for various large-
scale problems.
