Scribd
Upload
62 views2 pages

A - (A-Star) Searching

The A* algorithm is a searching algorithm that finds the shortest path between an initial and final state. It uses three parameters - g, the cost to move from start to current, h, the estimated cost to move from current to end, and f, the sum of g and h. The algorithm selects the cell with the smallest f value and moves there, continuing until reaching the goal cell. It is commonly used to calculate shortest distances on maps.

Uploaded by

Rakin Mohammad Sifullah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views2 pages

A - (A-Star) Searching

The A* algorithm is a searching algorithm that finds the shortest path between an initial and final state. It uses three parameters - g, the cost to move from start to current, h, the estimated cost to move from current to end, and f, the sum of g and h. The algorithm selects the cell with the smallest f value and moves there, continuing until reaching the goal cell. It is commonly used to calculate shortest distances on maps.

Uploaded by

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

A* (A-star) searching

Rakin Mohammad Sifullah

Mail : [email protected]
GitHub : https://github.com/sifullahrakin
A* Searching :

A * algorithm is a searching algorithm that searches for the shortest path between the initial and
the final state. It is used in various applications, such as maps.
In maps the A* algorithm is used to calculate the shortest distance between the source (initial
state) and the destination (final state).

A* algorithm has 3 parameters:


● g : the cost of moving from the initial cell to the current cell. Basically, it is the sum of all
the cells that have been visited since leaving the first cell.
● h : also known as the heuristic value, it is the estimated cost of moving from the current
cell to the final cell. The actual cost cannot be calculated until the final cell is reached.
Hence, h is the estimated cost. We must make sure that there is never an over estimation
of the cost.
● f : it is the sum of g and h. So, f = g + h
The way that the algorithm makes its decisions is by taking the f-value into account. The
algorithm selects the smallest f-valued cell and moves to that cell. This process continues until
the algorithm reaches its goal cell.

Code Link : https://github.com/sifullahrakin/Searching-Algorithms/blob/main/A*%20search


Dataset : https://github.com/sifullahrakin/Searching-Algorithms/blob/main/dnj_to_uap.csv

References :
1. https://www.educative.io
2. https://www.geeksforgeeks.org/
3. Artificial Intelligence: A Modern Approach by Russell, Stuart, Norvig, Peter

You might also like