Optimized AO* Algorithm for and-Or Graph Search

The objective of this paper is to optimize AO* algorithm with a depth limited search. AO* is one of the major AND-OR graph search algorithms. According to AO* algorithm it is not exploring all the solution paths once it has got the solution. Here the modified method is providing better heuristic value for the solution if the search space is unstable. It is also considering interacting sub problems in the in the search space considering the loop structures.