05-chapt4b

05-chapt4b - CSE630 LocalSearch(Iterative improvement Prof...

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

View Full Document Right Arrow Icon
CSE 630: Heuristic Search contd., Local Search (Iterative  improvement) Prof. Naeem Shareef
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Path Planning Assume we have a continuous moving robot What is the state space ?
Background image of page 2
3 Formulation #1 Cost of one horizontal/vertical step = 1 Cost of one diagonal step = 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Optimal Solution This path is the shortest in the discretized state space, but not in the original continuous space
Background image of page 4
5 Formulation #2 sweep-line
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 Formulation #2
Background image of page 6
7 States
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 Successor Function
Background image of page 8
9 Solution Path A path-smoothing post-processing step is usually needed to shorten the path further
Background image of page 9

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

View Full DocumentRight Arrow Icon
10
Background image of page 10
11 Solution Path The shortest path in this state space is also the shortest in the original continuous space
Background image of page 11

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

View Full DocumentRight Arrow Icon
12 (n 2 -1)-puzzle 1 2 3 4 5 6 7 8 12 15 11 14 10 13 9 5 6 7 8 4 3 2 1 ....
Background image of page 12
13 15-Puzzle Introduced (?) in 1878 by Sam Loyd, who dubbed himself “America’s greatest puzzle-expert”
Background image of page 13

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

View Full DocumentRight Arrow Icon
14 15-Puzzle Sam Loyd offered $1,000 of his own money to the first person who would solve the following problem: 12 14 11 15 10 13 9 5 6 7 8 4 3 2 1 12 15 11 14 10 13 9 5 6 7 8 4 3 2 1 ?
Background image of page 14
15 But no one ever won the prize !!
Background image of page 15

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

View Full DocumentRight Arrow Icon
16 How big is the state space of the (n 2 -1)- puzzle? 8-puzzle ?? states
Background image of page 16
17 How big is the state space of the (n 2 -1)- puzzle? 8-puzzle 9! = 362,880 states 15-puzzle 16! ~ 2.09 x 10 13 states 24-puzzle 25! ~ 10 25 states But only half of these states are reachable from any given state (but you may not know that in advance)
Background image of page 17

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

View Full DocumentRight Arrow Icon
18 The second state is not reachable from the first, and Sam Loyd took no risk with his money . .. 15- Puzzle Sam Loyd of f ered $1,000 of his own money t o t he f ir st per son who would solve t he f ollowing pr oblem: 12 14 11 15 10 13 9 5 6 7 8 4 3 2 1 ? 9 5 6 7 8 4 3 2 1
Background image of page 18
19 Let the goal be: A tile j appears after a tile i if either j appears on the same row as i to the right of i , or on another row below the row of i . For every i = 1, 2, . .., 15, let n i be the number of tiles j < i that appear after tile i N = n 2 + n 3 + + n 15 + row number of empty tile Permutation Inversions 12 15 11 14 10 13 9 5 6 7 8 4 3 2 1
Background image of page 19

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

View Full DocumentRight Arrow Icon
20 Let the goal be: Permutation Inversions 12 15 11 14 10 13 9 5 6 7 8 4 3 2 1 6 9 5 7 8 4 3 2 1 n 2 = 0 n 3 n 4 n 5 n 6 n 7 = 1 n 8 n 9 n = 4 n = 0 n N = 7 + 4
Background image of page 20
21 8-puzzle 362,880 states 15-puzzle 13 24-puzzle 10 states 100 millions states/sec 0.036 sec ~ 55 hours > 10 9 years 8-, 15-, 24-Puzzles
Background image of page 21

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

View Full DocumentRight Arrow Icon
22 8-Queens Problem Place 8 queens in a chessboard so that no two queens are in the same row, column, or diagonal. A solution Not a solution
Background image of page 22
23 Formulation #1 States: all arrangements of 0, 1, 2, . .., 8 queens on the board Initial state: 0 queens on the board Successor function: each of the successors is obtained by adding one queen in an empty square Arc cost: irrelevant Goal test: 8 queens are on the board, with no queens attacking each other ~ 64 x 63 x ... x 57 ~ 3 x 10 14 states
Background image of page 23

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

View Full DocumentRight Arrow Icon
24 Formulation #2 States: all arrangements of k = 0, 1, 2, . .., 8 queens in the k leftmost columns with no two queens attacking each other Initial state: 0 queens on the board Successor function: each successor is obtained by adding one queen in any square that is
Background image of page 24
Image of page 25
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/13/2010 for the course CSE 630 taught by Professor Naeemshareef during the Spring '10 term at Ohio State.

Page1 / 77

05-chapt4b - CSE630 LocalSearch(Iterative improvement Prof...

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

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