Week2part2 - CSE 3402 Intro to Artificial Intelligence...

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

View Full Document Right Arrow Icon
1 CSE 3402 Winter 2012 Yves Lesperance & Fahiem Bacchus 1 CSE 3402: Intro to Artificial Intelligence Uninformed Search II Required Readings: Chapter 3, Sec. 1-4. CSE 3402 Winter 2012 Yves Lesperance & Fahiem Bacchus 2 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea }, {Zerind, Timisoara, Arad, Oradea, Sibiu, Bucharest, RimnicuVilcea }, Solution: Arad -> Sibiu -> Fagaras -> Bucharest Cost: 140+99+211 = 450
Background image of page 1

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

View Full Document Right Arrow Icon
2 CSE 3402 Winter 2012 Yves Lesperance & Fahiem Bacchus 3 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea}, {Zerind, Timisoara, Arad, Oradea, Sibiu, Pitesi, Craiova<via RimnicuVilcea>}, {Zerind, Timisoara, Arad, Oradea, Sibiu, Craiova<via Pitesi>, Bucharest, Craiova<via RimnicuVilcea>}, § Solution: Arad -> Sibiu -> Rimnicu Vilcea -> Pitesti -> Bucharest Cost: 140+80+97+101 = 418 CSE 3402 Winter 2012 Yves Lesperance & Fahiem Bacchus 4 {Arad<>}, {Zerind<Arad>, Timisoara<Arad>, Sibiu<Arad>}, {Zerind <Arad>, Timisoara <Arad>, Oradea <Sibiu;Arad>, Fagaras<Sibiu;Arad>, Arad<Sibiu;Arad>, RimnicuVilcea<Sibiu;Arad>}, {Zerind <Arad>, Timisoara <Arad>, Oradea <Sibiu;Arad>, Fagaras<Sibiu;Arad>, Zerind<Arad;Sibiu;Arad>, Timisoara<Arad;Sibiu;Arad>, Sibiu<Arad;Sibiu;Arad>, RimnicuVilcea<Sibiu;Arad>}, No solution found, search does not terminate because of cycles!
Background image of page 2
3 CSE 3402 Winter 2012 Yves Lesperance & Fahiem Bacchus 5 Selection Rule. The example shows that order states are selected from the frontier has a critical effect on the operation of the search. Whether or not a solution is found The cost of the solution found. The time and space required by the search. CSE 3402 Winter 2012 Yves Lesperance & Fahiem Bacchus 6 Critical Properties of Search. Completeness : will the search always find a solution of a solution exists? Optimality : will the search always find the least cost solution? (when actions have costs) Time complexity : what is the maximum number of nodes than can be expanded or generated? Space complexity : what is the maximum number of nodes that have to be stored in memory?
Background image of page 3

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

View Full Document Right Arrow Icon
CSE 3402 Winter 2012 Yves Lesperance & Fahiem Bacchus 7 Uninformed Search Strategies These are strategies that adopt a fixed rule for selecting the next state to be expanded. The rule is always the same whatever the search problem being solved. These strategies do not take into account any domain specific information about the particular search problem. Popular uninformed search techniques: Breadth-First, Uniform-Cost, Depth-First, Depth- Limited, and Iterative-Deepening search. CSE 3402 Winter 2012 Yves Lesperance & Fahiem Bacchus 8 Selecting vs. Sorting A simple equivalence we will exploit Order the elements on the frontier. Always select the first element.
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 22

Week2part2 - CSE 3402 Intro to Artificial Intelligence...

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

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