ln016 - Searching & Planning Searching is about...

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

View Full Document Right Arrow Icon
Searching is about exploring alternatives . Uninformed search Does not use heuristics to speed up the search Potentially wastes a lot of time looking at completely unviable solutions “brute force” search Informed search Does use a heuristic to speed up the search (e.g. manhattan distance in A*) Only explores viable solutions Most AI search procedures are informed search procedures; the search spaces are usually too big to consider brute force search.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Search Some Path Optimal Path Games Depth-First Hill Climbing Breadth-First Beam Best-First British Museum Dynamic Programming A* Minimax Alpha-Beta Pruning Heuristic Pruning Heuristic Continuation Source: Artificial Intelligence, P. Winston, Addison-Wesley, 1984
Background image of page 2
A*: Another Perspective Form a queue of partial paths. Let the initial queue consist of the zero- length, zero-step path from the starting position to nowhere. Until the queue is empty or the goal is reached, determine if the first path in
Background image of page 3

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

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

This note was uploaded on 10/03/2011 for the course CSC 592 taught by Professor Staff during the Spring '11 term at Rhode Island.

Page1 / 7

ln016 - Searching & Planning Searching is about...

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

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