Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
23 views

A Algorithm

The A* search algorithm is a best-first search algorithm that finds the shortest path through a graph by expanding the node with the lowest combined cost of moves made so far and estimated cost to reach the goal. It uses a heuristic function to estimate the cost to get from each node to the goal, combining this with the actual cost to get from the start to that node to determine which node has the lowest total estimated cost. The algorithm expands nodes until it finds the goal node with the lowest total cost.

Uploaded by

weirdninjaofficial
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

A Algorithm

The A* search algorithm is a best-first search algorithm that finds the shortest path through a graph by expanding the node with the lowest combined cost of moves made so far and estimated cost to reach the goal. It uses a heuristic function to estimate the cost to get from each node to the goal, combining this with the actual cost to get from the start to that node to determine which node has the lowest total estimated cost. The algorithm expands nodes until it finds the goal node with the lowest total cost.

Uploaded by

weirdninjaofficial
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

A* Search Algorithm:

A* search is the most commonly known form of best-first search. It uses heuristic function h(n), and
cost to reach the node n from the start state g(n). It has combined features of UCS and greedy best-
first search, by which it solve the problem efficiently. A* search algorithm finds the shortest path
through the search space using the heuristic function. This search algorithm expands less search tree
and provides optimal result faster. A* algorithm is similar to UCS except that it uses g(n)+h(n) instead
of g(n).

In A* search algorithm, we use search heuristic as wel


combine both costs as following, and this sum is called

g(n) + h(n)

Estimated mst Cosfto reac;h


of the cneapest Cost to .reach from node nto
solution. nodenfrom -gbal node
tart state.

At each point in the search space, only those node is expanded which have the lowest value of
f(n), and the algorithm terminates when the goal node is found.

Algorithm of A* search:
Step1: Place the starting node in the OPEN list.

Step 2: Check if the OPEN list is empty or not, if the list is empty then return failure and stops.
Step 3: Select the node from the OPEN list which has the smallest value of evaluation function (g+h),
if node n is goal node then return success and stop, otherwise

Step 4: Expand node n and generate all of its successors, and put n into the closed list. For each
successor n', check whether n' is already in the OPEN or CLOSED list, if not then compute evaluation
function for n' and place into Open list.

Step 5: Else if node n' is already in OPEN and CLOSED, then it should be attached to the back pointer
which reflects the lowest g(n') value.

Step 6: Return to Step 2.

Advantages:
o A* search algorithm is the best algorithm than ot
o A* search algorithm is optimal and complete.
o This algorithm can solve very complex problems.

Disadvantages:

o It does not always produce the shortest path as it mostly based on heuristics and
approximation.
o A* search algorithm has some complexity issues.

o 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.

Example:

In this example, we will traverse the given graph using the A* algorithm. The heuristic value of all
states is given in the below table so we will calculate the f(n) of each state using the formula f(n)=
g(n) + h(n), where g(n) is the cost to reach any node from start state.

Here we will use OPEN and CLOSED list.

tate h(n)
B
y
y 1

·G
B
2
I
8

Solution:
'
I

l"

Initialization: {(S, 5)}

lteration1: {(S--> A, 4), (S-->G, 10)}

lteration2: {(S--> A-->C, 4), (S--> A-->B, 7), (S-->G, 10)}

lteration3: {(S--> A-->C--->G, 6), (S--> A-->C--->D, 11), (S--> A-->B, 7), (S-->G, 10)}

Iteration 4 will give the final result, as S--->A--->C--->G it provides the optimal path with cost 6.

You might also like