8/29. administrative.. bouncing mails –qle01; jmussem; rbalakr2 send me a working email address...
Post on 19-Dec-2015
214 views
TRANSCRIPT
![Page 1: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/1.jpg)
8/29
![Page 2: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/2.jpg)
Administrative..
• Bouncing mails– Qle01; jmussem; rbalakr2
• Send me a working email address for class list
• Blog posting issues
• Recitation session for Homework 1?– Mail sent by Will Cushing (respond to him)– Show of hands…
![Page 3: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/3.jpg)
Representation Mechanisms: Logic (propositional; first order) Probabilistic logic
Learning the models
Search Blind, InformedPlanning Inference Logical resolution Bayesian inference
How the course topics stack up…
![Page 4: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/4.jpg)
Problem Solving Agents (Search-based Agents)
![Page 5: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/5.jpg)
![Page 6: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/6.jpg)
![Page 7: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/7.jpg)
The important difference from the graph-search scenario you learned in CSE 310 is that you want to keep the graph implicit rather than explicit (i.e., generate only that part of the graph that is absolutely needed to get the optimal path) VERY important since for most problems, the graphs are humongous..
![Page 8: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/8.jpg)
![Page 9: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/9.jpg)
![Page 10: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/10.jpg)
What happens w
hen the domain
Is inaccessib
le?
![Page 11: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/11.jpg)
Given a state space of size n the single-state problem searches for a path in the graph of size n the multiple-state problem searches for a path in a graph of size 2n
the contingency problem searches for a sub-graph in a graph of size 2n
Utility of eyes (sensors) is reflected in the size of the
effective search space!
In general, a subgraph rather than a tree (loops may be needed consider closing a faulty door )
2n is the EVILthat every CS student’s nightmares are made of
![Page 12: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/12.jpg)
Search in Multi-state(inaccessible)version
Set of states isCalled a “Belief State” So we are searching in the space of belief states
You search in thisSpace even if yourInit state is knownBut actions areNon-deterministic
Sensing reducesState Uncertainty
![Page 13: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/13.jpg)
![Page 14: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/14.jpg)
![Page 15: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/15.jpg)
![Page 16: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/16.jpg)
![Page 17: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/17.jpg)
![Page 18: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/18.jpg)
??
General S
earch
![Page 19: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/19.jpg)
All search algorithms must do goal-test only when the node is picked up for expansion
![Page 20: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/20.jpg)
Search algorithms differ based on the specific queuing function they use
![Page 21: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/21.jpg)
![Page 22: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/22.jpg)
![Page 23: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/23.jpg)
![Page 24: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/24.jpg)
![Page 25: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/25.jpg)
Breadth first search on a uniform tree of b=10 Assume 1000nodes expanded/sec 100bytes/node
![Page 26: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/26.jpg)
![Page 27: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/27.jpg)
Qn: Is there a way of getting linear memory search that is complete and optimal?
![Page 28: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/28.jpg)
The search is “complete” now (since there is finite space to be explored). But still inoptimal.
![Page 29: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/29.jpg)
![Page 30: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/30.jpg)
![Page 31: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/31.jpg)
8/31
![Page 32: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/32.jpg)
All search algorithms must do goal-test only when the node is picked up for expansion
![Page 33: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/33.jpg)
Search algorithms differ based on the specific queuing function they use
We typically analyze properties of search algorithms on uniform trees --with uniform branching factor b and goal depth d (tree itself may go to depth dt )
![Page 34: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/34.jpg)
Num iterations: (d+1)
Asymptotic ratio of # nodes expanded by IDDFS vs DFS
(b+1)/ (b-1) (approximates to 1 when b is large)
IDDFS: Review
![Page 35: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/35.jpg)
A
B
C
D
G
DFS:
BFS:
IDDFS:
A,B,GA,B,C,D,G(A), (A, B, G)
Note that IDDFS can do fewer Expansions than DFS on a graphShaped search space.
![Page 36: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/36.jpg)
![Page 37: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/37.jpg)
A
B
C
D
G
DFS:
BFS:
IDDFS:
A,B,GA,B,A,B,A,B,A,B,A,B(A), (A, B, G)
Note that IDDFS can do fewer Expansions than DFS on a graphShaped search space.
Search on undirected graphs or directed graphs with cycles… Cycles galore…
![Page 38: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/38.jpg)
Graph (instead of tree) Search: Handling repeated nodes
Main points: --repeated expansions is a bigger issue for DFS than for BFS or IDDFS --Trying to remember all previously expanded nodes and comparing the new nodes with them is infeasible --Space becomes exponential --duplicate checking can also be exponential--Partial reduction in repeated expansion can be done by --Checking to see if any children of a node n have the same state as the parent of n -- Checking to see if any children of a node n have the same state as any ancestor of n (at most d ancestors for n—where d is the depth of n)
![Page 39: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/39.jpg)
A
B
C
D
G
9
1
1
1
2
Uniform Cost Search
No:A (0)
N1:B(1) N2:G(9)
N3:C(2)
N4:D(3)
N5:G(5)
Completeness?Optimality? if d < d’, then paths with d distance explored before those with d’
Branch & Bound argument (as long as all op costs are +ve)
Efficiency? (as bad as blind search..)
A
B
C
D
G
9
0.1
0.1
0.1
25
Bait &SwitchGraph
Notation: C(n,n’) cost of the edge between n and n’ g(n) distance of n from root dist(n,n’’) shortest distance between n and n’’
![Page 40: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/40.jpg)
Visualizing Breadth-First & Uniform Cost Search
Breadth-First goes level by level
This is also a proof of optimality…
![Page 41: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/41.jpg)
Proof of Optimality of Uniform search
Proof of optimality: Let N be the goal node we output.Suppose there is another goal node N’We want to prove that g(N’) >= g(N)Suppose this is not true. i.e. g(N’) < g(N) --Assumption A1
When N was picked up for expansion,Either N’ itself, or some ancestor of N’,Say N’’ must have been on the search queue
If we picked N instead of N’’ for expansion,It was because
g(N) <= g(N’’) ---Fact f1
But g(N’) = g(N’’) + dist(N’’,N’)So g(N’) >= g(N’’)So from f1, we have g(N) <= g(N’) But this contradicts our assumption A1
No
N N’
N’’
Holds only because dist(N’’,N’) >= 0 This will hold if every operator has +ve cost
![Page 42: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/42.jpg)
“Informing” Uniform search…
A
B
C
D
G
9
0.1
0.1
0.1
25
Bait &SwitchGraph
No:A (0)
N1:B(.1) N2:G(9)
N3:C(.2)
N4:D(.3)
N5:G(25.3)
Would be nice if we could tell thatN2 is better than N1 --Need to take not just the distance until now, but also distance to goal --Computing true distance to goal is as hard as the full search --So, try “bounds” h(n) prioritize nodes in terms of f(n) = g(n) +h(n) two bounds: h1(n) <= h*(n) <= h2(n) Which guarantees optimality?--h1(n) <= h2(n) <= h*(n) Which is better function?
Admissibility
Informedness
![Page 43: 8/29. Administrative.. Bouncing mails –Qle01; jmussem; rbalakr2 Send me a working email address for class list Blog posting issues Recitation session](https://reader030.vdocuments.site/reader030/viewer/2022032800/56649d3a5503460f94a14892/html5/thumbnails/43.jpg)
A*