3_SP10 cs188 lecture 3 -- a-star search (2PP)

3_SP10 cs188 lecture 3 -- a-star search (2PP) - s Chooses...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
3 Recap: Search s Search problem: s States (configurations of the world) s Successor function: a function from states to lists of (state, action, cost) triples; drawn as a graph s Start state and goal test s Search tree: s Nodes: represent plans for reaching states s Plans have costs (sum of action costs) s Search Algorithm: s Systematically builds a search tree
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: s Chooses an ordering of the fringe (unexplored nodes) DFS DFS and BFS Algorithm Complete Optimal Time Space DFS w/ Path Checking BFS Y N O( b m ) O( bm ) b 1 node b nodes b 2 nodes b m nodes … s tiers Y N* O( b s+1 ) O( b s+1 ) b s nodes … BFS m tiers...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online