Heuristic_Search_Part2

Heuristic_Search_Part2 - Heuristic (Informed) Search...

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

View Full Document Right Arrow Icon
1 Heuristic (Informed) Search R&N: Chap. 4, Sect. 4.1–3
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Iterative Deepening A* (IDA*) Ide a: Re duc e  m e m o ry re q uire m e nt o f A*  b y applying  c uto ff o n va lue s  o f f C o ns is te nt he uris tic  func tio n h Alg o rithm  IDA*: 1. Initia lize  c uto ff to  f(initia l-no de ) 2. Re pe a t: a. Pe rfo rm  de pth-firs t s e a rc h b y e xpa nding  a ll  no de s  N s uc h tha t f(N)   c uto ff b. Re s e t c uto ff to  s m a lle s t va lue  f o f no n-e xpa nde d  (le a f) no de s
Background image of page 2
3 8-Puzzle 4 6 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s C uto ff= 4
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 8-Puzzle 4 4 6 C uto ff= 4 6 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 4
5 8-Puzzle 4 4 6 C uto ff= 4 6 5 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 8-Puzzle 4 4 6 C uto ff= 4 6 5 5 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 6
7 4 8-Puzzle 4 6 C uto ff= 4 6 5 5 6 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 8-Puzzle 4 6 C uto ff= 5 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 8
9 8-Puzzle 4 4 6 C uto ff= 5 6 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 9

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

View Full DocumentRight Arrow Icon
10 8-Puzzle 4 4 6 C uto ff= 5 6 5 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 10
11 8-Puzzle 4 4 6 C uto ff= 5 6 5 7 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 11

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

View Full DocumentRight Arrow Icon
12 8-Puzzle 4 4 6 C uto ff= 5 6 5 7 5 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 12
13 8-Puzzle 4 4 6 C uto ff= 5 6 5 7 5 5 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s
Background image of page 13

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

View Full DocumentRight Arrow Icon
14 8-Puzzle 4 4 6 C uto ff= 5 6 5 7 5 5 f(N) = g (N) + h(N)     with h(N) = num b e r o f  m is pla c e d tile s 5
Background image of page 14
15 Advantages/Drawbacks of IDA* Adva ntag e s : S till c o m ple te  a nd o ptim a l Re q uire s   le s s  m e m o ry  tha n A* Avo id the  o ve rhe a d to  s o rt the  fring e Dra wb a c ks : C a n’t a vo id re vis iting  s ta te s  no t o n the  c urre nt  pa th Es s e ntia lly a  DFS Ava ila b le  m e m o ry is  po o rly us e d  (  m e m o ry-b o unde d s e a rc h, s e e  R&N p. 101-104)
Background image of page 15

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

View Full DocumentRight Arrow Icon
16 Another approach… Local Search Algorithms Hill-climbing or Gradient descent Simulated Annealing Genetic Algorithms, others…
Background image of page 16
Image of page 17
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/15/2011 for the course CAP 4630 taught by Professor Staff during the Fall '08 term at FAU.

Page1 / 39

Heuristic_Search_Part2 - Heuristic (Informed) Search...

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

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