Professional Documents
Culture Documents
I
Best First Search / Greedy Search
A* Search Algorithm
Uninformed Vs Informed
• Uninformed • Informed
• Uses a problem specific heuristic
• Worked only on function h(n) - estimated cost of
the cheapest path from the state at
problem definition node n to a goal state.
• Node selection • Node selection based on evaluation
function f(n)
based on path cost
• Informed search algorithms
g(n) / other criteria • Best First Search / Greedy search
• f(n) = h(n)
• A*
• f(n) = h(n) + g(n)
Generic Best First Search
Initial Node
Goal Node
Greedy search - Example Route Finding
• Heuristic function
Solution
Initial Node
Goal Node
Performance Measures - Completeness
• Completeness
• Tree search - Initial Node
Incomplete Infinite loop
even in finite Goal Node
state spaces
• Graph search –
complete in
finite spaces,
incomplete in
infinite ones
Performance Measure – Optimality
Not optimal
Initial Node
Goal Node
Performance measure of greedy search