session06

# session06 - Last time Problem-Solving Problem solving Goal...

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

CS 561, Session 6 1 Last time: Problem-Solving Problem solving: • Goal formulation • Problem formulation (states, operators) • Search for solution Problem formulation: • Initial state • ? • ? • ? Problem types: • single state: accessible and deterministic environment • multiple state: ? • contingency: ? • exploration: ?

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

View Full Document
CS 561, Session 6 2 Last time: Problem-Solving Problem solving: • Goal formulation • Problem formulation (states, operators) • Search for solution Problem formulation: • Initial state • Operators • Goal test • Path cost Problem types: • single state: accessible and deterministic environment • multiple state: ? • contingency: ? • exploration: ?
CS 561, Session 6 3 Last time: Problem-Solving Problem solving: • Goal formulation • Problem formulation (states, operators) • Search for solution Problem formulation: • Initial state • Operators • Goal test • Path cost Problem types: • single state: accessible and deterministic environment • multiple state: inaccessible and deterministic environment • contingency: inaccessible and nondeterministic environment • exploration: unknown state-space

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

View Full Document
CS 561, Session 6 4 Last time: Finding a solution Function General-Search( problem , strategy ) returns a solution , or failure initialize the search tree using the initial state problem loop do if there are no candidates for expansion then return failure choose a leaf node for expansion according to strategy if the node contains a goal state then return the corresponding solution else expand the node and add resulting nodes to the search tree end Solution: is ??? Basic idea: offline, systematic exploration of simulated state-space by generating successors of explored states (expanding)
CS 561, Session 6 5 Last time: Finding a solution Function General-Search( problem , strategy ) returns a solution , or failure initialize the search tree using the initial state problem loop do if there are no candidates for expansion then return failure choose a leaf node for expansion according to strategy if the node contains a goal state then return

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 38

session06 - Last time Problem-Solving Problem solving Goal...

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

View Full Document
Ask a homework question - tutors are online