383-Fall11-Lec5 - 1 CMPSCI 383 September 20, 2011 Informed...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: 1 CMPSCI 383 September 20, 2011 Informed (Heuristic) Search 2 Tip for doing well Begin Assignments Early 3 Today’s lecture Informed (Heuristic) search methods • Best-First Search • Greedy Best-First Search • A* search • Heuristic functions 4 Review: Uninformed search strategies • Breadth-first search • Uniform-cost search • Depth-first search • Depth-limited search • Iterative deepening depth-first search 5 Review 6 Review • Breadth-first search • Selects shallowest unexpanded node • FIFO queue • Uniform-cost search • Selects node with lowest path cost • Priority queue by path cost • Depth-first search • Selects deepest unexpanded node • LIFO queue (stack) • Depth-limited search • Depth-first with nodes at depth limit treated as having no successors • Iterative deepening depth-first search • Repeated depth-limited with increasing limit until goal found Note: step costs assumed non-negative 7 Review: How do you evaluate a search strategy? • Completeness — Does it always find a solution if one exists? • Optimality — Does it find the best solution? • Time complexity • Space complexity 8 Informed (heuristic) search strategies Use problem-specific knowledge beyond what is given in the problem definition 9 Best-First Search • Idea : use an evaluation function f(n) • For each node, gives an 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 10 Heuristic function • heuristic function h(n) — estimated cost of the cheapest path form the state at node n to a goal state. • “Heuristic” • “proceeding to a solution by trial and error or by rules that are only loosely defined.” * • “a technique designed to solve a problem that ignores whether the solution can be proven to be correct, but which usually produces a good solution or solves a simpler problem that...
View Full Document

This note was uploaded on 11/29/2011 for the course COMPSCI 383 taught by Professor Andrewbarto during the Fall '11 term at UMass (Amherst).

Page1 / 41

383-Fall11-Lec5 - 1 CMPSCI 383 September 20, 2011 Informed...

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