Uniform cost search is similar to breadth-first search but pursues the path with the lowest accumulated cost rather than minimizing depth. It calculates the path cost g(n) as the total cost of the path from the initial node to node n, rather than just considering depth. This means uniform cost search prioritizes expanding nodes with the lowest cost paths found so far, making it optimal for problems where path costs are uniform.

1. Problem Solving and Search
Lecture 3

26.  Uniform Cost SearchUniform Cost Search
* Similar to Breath-First.
* Pursues the path with less accumulated cost.
* Uniform Cost: minimizes g(n) = path_cost(n)
* Breath-First: minimizes g(n) = depth(n)
Search
3
1 15
A
CB D
A
B C D
F
15
3
5
110
1
E
1
3
1
10
15
5
A
CB D
F E
F
3
1
10
15
5
A
CB D
F E
10
F
1