14 Jan 2004
CS 3243 - Blind Search
31
Uniform-cost search
nExpand least-cost unexpanded node
nImplementation:
nfringe = queue
ordered by path cost
nEquivalent to breadth-first if step costs all
equal
nComplete? Yes, if step cost ≥ ε
nTime? # of nodes with g
≤ cost of optimal solution, O(bceiling(C*/
ε)) where C* is the cost of the optimal solution
nSpace? # of nodes with g ≤ cost of optimal solution, O(bceiling(C*/
ε))
nOptimal? Yes – nodes expanded in increasing order of g(n)