Uniform-Cost Search Algorithm
If all the edges in the search graph do not have the same cost then breadth-first search generalizes to uniform-cost search.
Uniform-cost search is a special case of the A* search algorithm if its heuristic is a constant function. Breadth-first search (BFS) is a special case of A* when all edge costs are positive and identical.
Uniform-cost search, on the other hand, minimizes the cost of the path so far, g(n);
f(n) = g(n) + h(n).
If h is admissible, f(n) never overestimates the actual cost of the best solution through n. Bestfirst ...
 See also: Search algorithm, Depth-first search, Hill climbing, Dynamic programming, Artificial intelligence
  
|
RSS
