4b-search-4p - Best-First Search Idea: use a function f for...

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

View Full Document Right Arrow Icon
Artificial Intelligence Informed Search and Exploration Readings: Norvig. Best-First Search Idea: use a function f for each node n to estimate of “desirability” Strategy: Alwasy expand unexpanded node n with least f ( n ) Implementation: fringe is a priority queue sorted in decreasing order of f ( n ) Special cases: greedy search: f ( n ) = h ( n ) A search: f ( n ) = g ( n ) + h ( n ) where g ( n ) is the real cost from the initial node to n and h ( n ) is an estimate of the cost from n to a goal. Properties of Heuristic Function Admissible: h ( n ) h ( n ) for any node, where h ( n ) is the true cost from n to the nearest goal. Consistent: h ( n ) + c ( n, a, n ) h ( n ) , where n = R ESULT ( A , N ) ( n ) . Optimality/Completeness of A* Search If the problem is solvable, A* always finds an optimal solution when the standard assumptions are satisfied, the heuristic function is admissible. A* is optimally efficient for any heuristic function h : No other optimal strategy expands fewer nodes than A*.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Complexity of A* Search Worst-case time complexity: still exponential ( O ( b d ) ) unless the error in h is bounded by the logarithm of the actual path cost. That is, unless | h ( n ) - h ( n ) | ≤ O (log h ( n )) where h ( n ) = actual cost from n to goal. Worst-Case Space Complexity: O ( b m ) as in greedy best-first. A* generally runs out of memory before running out of time. Improvements: IDA*, SMA*. How to Obtain Admissible Heuristics Admissible heuristics can be derived from the exact solution cost of a relaxed version of the problem Example: the 8-puzzle h 1 ( n ) = number of misplaced tiles How: If the rules of the 8-puzzle are relaxed so that a tile can move anywhere , then h 1 ( n ) gives the shortest solution h 2 ( n ) = total Manhattan distance (i.e., number of squares from desired location of each tile) How: If the rules are relaxed so that a tile can move to any adjacent square , then h 2 ( n ) gives the shortest solution. Key point: the optimal cost of a relaxed problem is no
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/23/2010 for the course QWE asd taught by Professor Asd during the Spring '10 term at University of Karachi.

Page1 / 7

4b-search-4p - Best-First Search Idea: use a function f for...

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

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