ai-prolog5

# ai-prolog5 - Artificial Intelligence Knowledge...

This preview shows pages 1–7. Sign up to view the full content.

1 Artificial Intelligence: Knowledge Representation Using Search in Problem Solving Intro to Basic Search Techniques Heuristic Search

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

View Full Document
2 Intro: Search and AI In solving problems, we sometimes have to search through many possible ways of doing something. We may know all the possible actions our robot can do, but we have to consider various sequences to find a sequence of actions to achieve a goal. We may know all the possible moves in a chess game, but we must consider many possibilities to find a good move. Many problems can be formalized in a general way as search problems.
3 Search and Problem Solving Search problems described in terms of: An initial state. (e.g., initial chessboard, current positions of objects in world, current location) A target state .(e.g., winning chess position, target location) Some possible actions, that get you from one state to another. (e.g. chess move, robot action, simple change in location). Search techniques systematically consider all possible action sequences to find a path from the initial to target state.

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

View Full Document
4 Simple Example Easiest to first look at simple examples based on searching for route on a map. How do we systematically and exhaustively search possible routes, in order to find, say, route from library to university? Factory School Library Hospital Park Newsagent University church
5 Search Space The set of all possible states reachable from the initial state defines the search space . We can represent the search space as a tree. We refer to nodes connected to and “under” a node in the tree as “successor nodes”. library school hospital factory park newsagent university church

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

View Full Document
6 Simple Search Techniques How do we search this tree to find a possible route from library to University? May use simple systematic search techniques,
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/20/2011 for the course CS 6810 taught by Professor Hecker during the Spring '10 term at CSU East Bay.

### Page1 / 24

ai-prolog5 - Artificial Intelligence Knowledge...

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

View Full Document
Ask a homework question - tutors are online