This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 Last time: ProblemSolving • 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: ? 2 Last time: ProblemSolving • 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: ? 3 Last time: ProblemSolving • 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 statespace 4 Last time: Finding a solution Function GeneralSearch( 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 statespace by generating successors of explored states (expanding) 5 Last time: Finding a solution Function GeneralSearch( 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...
View
Full
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.
 Spring '10
 Hecker
 Artificial Intelligence

Click to edit the document details