Lect3 - Start reading Ch. 7, 8, 9 Project topics Course web...

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

View Full Document Right Arrow Icon
1 Start reading Ch. 7, 8, 9 Project topics Course web site http://www.cs.illinois.edu/class/cs440/ or http://www.cs.uiuc.edu/class/fa10/cs440
Background image of page 1

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

View Full DocumentRight Arrow Icon
SEARCH(Problem P, Queuing Function QF): local: n /* current node */ q /* nodes to explore */ q singleton of Initial_State(P); Loop: if q = () return failure; n Pop(q); if n Solves P return n; q QF(q, Expand(n)); end Depth First: QF(old, new): Append(new, old); Breadth First: QF(old, new): Append(old, new); Generic Search Function 2
Background image of page 2
Sample Search Tree A D C B J I H G F E Depth First n q (between iterations) - (A) A (B C D) B (E F C D) E (F C D) F (C D) C (G D) G (D) 3
Background image of page 3

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

View Full DocumentRight Arrow Icon
Sample Search Tree A D C B J I H G F E Breadth First n q - (A) A (B C D) B (C D E F) C (D E F G) D (E F G H I J) E (F G H I J)    4
Background image of page 4
Costs Performing the search to find Goal Time Space Executing an operator in the world We will focus on execution cost We assume Positive finite cost for each action Finite branching factor Important cost functions: g, h, f 5
Background image of page 5

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

View Full DocumentRight Arrow Icon
Define: g*(n) as minimum cost from root to n n Nodes Define: g(n) as an easily computable approximation to g* How might we compute g? Need an execution cost model for each operator How might g(n) g*(n)? In fact it is usually easy to guarantee g(n) g*(n) (especially for trees!) Note the node alone determines which operators can apply next (First Order Markov: history is unimportant to world dynamics more later) 6
Background image of page 6
Define: h*(n) as minimum cost from n to a goal n Nodes Define: h(n) as an easily computable approximation to h* h is called a “heuristic function” Define: f(n) as g(n) + h(n) I n G g*(n) h*(n) Initial State Lowest cost solution constrained through n f(n) approximates this 7
Background image of page 7

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

View Full DocumentRight Arrow Icon
admissible iff for all search trees: A) If there exists a goal, the search will not fail. B) If there are multiple goals the search will find the best (least
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/13/2011 for the course CS 440 taught by Professor Levinson,s during the Fall '08 term at University of Illinois, Urbana Champaign.

Page1 / 32

Lect3 - Start reading Ch. 7, 8, 9 Project topics Course web...

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

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