2. Introduction
AO*algorithm is a powerful search
technique used in artificial intelligence and
computer science.
- It aims to find optimal paths or solutions in a
graph or state space.
- Particularly useful for robotics, pathfinding,
and planning
3. Key Concepts
AND-OR Graphs
• AND-OR graphs - is the process to break down complex problems:
- AND side: Represents tasks that must be completed
together to achieve the main goal.
- OR side: Represents different methods for accomplishing the
same goal.
5. Working of AO* Algorithm
The evaluation function in AO* looks like this:
f(n) = g(n) + h(n)
f(n) = Actual cost + Estimated cost
here,
f(n) = The actual cost of traversal.
g(n) = the cost from the initial node to the current node.
h(n) = estimated cost from the current node to the goal state.
6. Difference between the A*
Algorithm and AO* algorithm
• A* algorithm and AO* algorithm both works on the best first
search.
• They are both informed search and works on given heuristics
values.
• A* always gives the optimal solution but AO* doesn’t guarantee to
give the optimal solution.
• Once AO* got a solution doesn’t explore all possible paths but A*
explores all paths.
• When compared to the A* algorithm, the AO* algorithm uses less
memory.
• opposite to the A* algorithm, the AO* algorithm cannot go into an
7. Conclusion
-AO* algorithim combines optimism with efficiency, also a valuable
tool for solving complex problems and Explore further resources for
deeper understanding.
2. [Baeldung: AO* Algorithm
Explanation](https://www.baeldung.com/cs/ao-star-algorithm)](https://image.slidesharecdn.com/aoalgorithm-250401111243-97dde231/85/ARTIFICAIL-INTELLIGENCE-AO-ALGORITHMS-NOTES-8-320.jpg)