Question

Difference between a* and ao* search algorithm

Answer 1

In a* algorithm you simply traverse the tree in depth and keep moving and simply adding up the total cost of teaching the cost from the current state to the goal state and adding it to the cost of reaching the current state. 

I. E. 

F(y) =g(y) +h(y) 

G(y)  is the cost to reach the current state and
H(y)  is the cost of reaching the goal state from current state. 


In ao* algorithm, the procedure is similar but there are and constraints traversing specific paths. If you are traversing those paths, cost of all the paths originating from the preceding node are added till that level, where you find the goal state irrespective of whether they take you to the goal state or not.

If you still have doubts,  watch the nptel videos. They're very precise and easy to understand. 

Thank you.