Transcription of Heuristic (Informed) Search
{{id}} {{{paragraph}}}
1 Heuristic (Informed) Search (Wh t t h tl ) 1(Where we try to choose smartly) R&N: Chap. 4, Sect. 3 Search Algorithm #2 Search # (initial-node,FRINGE)Recall that the orderingof FRINGE defines the Search empty(FRINGE) then return REMOVE(FRINGE) STATE(N) GOAL?(s) then return path or goal every state s in SUCCESSORS(s) a node N as a successor of (N ,FRINGE)Best-First Search It exploits state descriptionto estimate how good each Search node is An evaluation functionf maps each node N of the Search tree to a real number 3f(N) 0 [Traditionally, f(N) is an estimated cost; so, the smaller f(N), the more promising N] Best-first searchsorts the FRINGE in increasing f[Arbitrary order is assumed among nodes with equal f]Best-First Search It exploits state descriptionto estimate how good each Search node is An evaluation functionf maps each node N of the Search tree to a real number B
4 h (N) = number of misplaced tiles = 6 8-Puzzle Heuristics 4 1 7 5 2 3 6 8 STATE (N) 4 6 7 1 5 2 8 3 Goal state 19 1 is admissible h 2(N) = sum of the (Manhattan) distances of …
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}