Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.
-
Upload
frankie-ealy -
Category
Documents
-
view
217 -
download
0
Transcript of Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.
![Page 1: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/1.jpg)
Informed (Heuristic) Search Algorithms
![Page 2: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/2.jpg)
Homework #1 assigned
due 10/4 before Exam 1
2
![Page 3: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/3.jpg)
A
B
C
D
G
9
.1
.1
.1
25
Evaluating heuristic functions
No:A (0+7)
N1:B(.1+8.6) N2:G(9+0)
N3:C(.2+8.7)
N4:D(.3+25)
7
20
0
28
25
7
8.6
0
8.7
25
9
25.2
0
25.1
25
No:A (0)
N1:B(.1+25.2) N2:G(9+0)
Is pink-h admissible?
Is green-h admissible?
node A B C D G
h1(n) 7 8.6 8.7 25 0
h2(n) 9 25.2 25.1 25 0
![Page 4: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/4.jpg)
or h2 is more informed than h1
![Page 5: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/5.jpg)
5
UCS
A*
Uniform-cost and A*
![Page 6: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/6.jpg)
h*
h1
h4
h5
Admissibility/Informedness
h2h3
Max(h2,h3)
Seach Nodes
Heu
rist
ic V
alue
![Page 7: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/7.jpg)
7
![Page 8: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/8.jpg)
8
![Page 9: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/9.jpg)
9
![Page 10: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/10.jpg)
10
![Page 11: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/11.jpg)
11
![Page 12: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/12.jpg)
12
![Page 13: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/13.jpg)
13
Not required for HW and exam purposes
Consistency admissibilityAdmissibility consistency
Consistency
![Page 14: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/14.jpg)
14
UCSg(n)
Greedyh(n)
A*f(n) = g(n) + h(n)
![Page 15: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/15.jpg)
15
![Page 16: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/16.jpg)
16
![Page 17: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/17.jpg)
17
![Page 18: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/18.jpg)
18
![Page 19: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/19.jpg)
19
![Page 20: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/20.jpg)
IDA*• Basicaly IDDFS, except instead of the iterations being
defined in terms of depth, we define it in terms of f-value– Start with the f cutoff equal to the f-value of the root
node– Loop
• Generate and search all nodes whose f-values are less than or equal to current cutoff.
– Use depth-first search to search the trees in the individual iterations
– Keep track of the node N’ which has the smallest f-value that is still larger than the current cutoff. Let this f-value be next-largest-f-value
-- If the search finds a goal node, terminate. If not, set cutoff = next-largest-f-value and go back to Loop
Properties: Linear memory. #Iterations in the worst case? =
bd (Happens when all nodes have distinct f-values.)
![Page 21: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/21.jpg)
Who will give you admissible h(n)?
21
![Page 22: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/22.jpg)
Relaxed problems
Obtain heuristic from relaxed problems The more relaxed, the easier to compute heuristic, but the less accurate it is
For 8-puzzle problem?
Assume ability to move the tile directly to the place distance= # misplaced tilesAssume ability to move only one position at a time distance = Sum of Manhattan distances.
A problem with fewer restrictions on the actions is called a relaxed problem.
![Page 23: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/23.jpg)
23
![Page 24: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/24.jpg)
24
![Page 25: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/25.jpg)
Different levels of abstraction for shortest path problems on the plane
I
G
I
G
“circular abstraction”
I
G
“Polygonal abstraction”
I
G
“disappearing-act abstraction”
hD
hC
hP
h*
The obstacles in the shortest path problem canbe abstracted in a variety of ways. --The more the abstraction, the cheaper it is to solve the problem in abstract space --The less the abstraction, the more “informed” the heuristic cost (i.e., the closer the abstract path length to actual path length)
ActualWhy are we inscribing the obstacles rather than circumscribing them?
![Page 26: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/26.jpg)
hDhC hP
h*h0
Cost of computing the heuristic
Cost of searching with the heuristic
Total cost incurred in search
Not always clear where the total minimum occurs• Old wisdom was that the global min was
closer to cheaper heuristics• Current insights are that it may well be far
from the cheaper heuristics for many problems
How informed should the heuristic be?
I
G
I
G
“circular abstraction”
I
G
“Polygonal abstraction”
I
GhD
hC
hP
h*Actual
Reduced level of abstraction (i.e. more and more concrete)
![Page 27: Informed (Heuristic) Search Algorithms. Homework #1 assigned due 10/4 before Exam 1 2.](https://reader035.fdocuments.us/reader035/viewer/2022062519/56649cba5503460f94981efb/html5/thumbnails/27.jpg)