6 Informed searching

6 Informed searching - Informed search algorithms Outline...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
Informed search algorithms
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Outline Best-first search Greedy best-first search A * search Heuristics Local search algorithms Hill-climbing search Simulated annealing search Local beam search Genetic algorithms
Background image of page 2
Best-first search Idea: use an evaluation function f(n) for each node estimate of "desirability" Expand most desirable unexpanded node Implementation : Order the nodes in fringe in decreasing order of desirability Special cases: greedy best-first search A * search
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Greedy best-first search Evaluation function f(n) = h(n) ( h euristic) = estimate of cost from n to goal • e.g., h SLD (n) = straight-line distance from n to Bucharest Greedy best-first search expands the node that appears to be closest to goal
Background image of page 4
Greedy best-first search example
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Greedy best-first search example
Background image of page 6
Greedy best-first search example
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Greedy best-first search example
Background image of page 8
Properties of greedy best-first search Complete? No – can get stuck in loops, e.g., Iasi Neamt Iasi Neamt Time? O(b m ) , but a good heuristic can give dramatic improvement Space? O(b m ) -- keeps all nodes in memory Optimal? No
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
* search Idea: avoid expanding paths that are already expensive Evaluation function f(n) = g(n) + h(n) g(n)
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 32

6 Informed searching - Informed search algorithms Outline...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online