03-informed_search - Informed Methods: Heuristic Search...

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

View Full Document Right Arrow Icon
1 Foundations of Artificial Intelligence Informed Search CS472 – Fall 2007 Thorsten Joachims Informed Methods: Heuristic Search Idea: Informed search by using problem-specific knowledge. Best-First Search : Nodes are selected for expansion based on an evaluation function , f ( n ). Traditionally, f is a cost measure. Heuristic: Problem specific knowledge that (tries to) lead the search algorithm faster towards a goal state. Often implemented via heuristic function h(n). Heuristic search is an attempt to search the most promising paths first. Uses heuristics, or rules of thumb, to find the best node to expand next. Generic Best-First Search 1. Set L to be the initial node(s) representing the initial state(s). 2. If L is empty, fail. Let n be the node on L that is ``most promising'‘ according to f . Remove n from L . 3. If n is a goal node, stop and return it (and the path from the initial node to n ). 4. Otherwise, add successors ( n ) to L . Return to step 2. Greedy Best-First Search Heuristic function h(n): estimated cost from node n to nearest goal node. Greedy Search : Let f(n) = h(n). Example : 8-puzzle 4 4 5 6 1 732 8 2 1 8 3 765 Start State Goal State Example: Suboptimal Best First-Search There exist strategies that enable optimal paths to be found without examining all possible paths.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

03-informed_search - Informed Methods: Heuristic Search...

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

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