Intr和oduction toArtificial Intelligence.pptVIP

Search Introduction toArtificial Intelligence COS302 Michael L. Littman Fall 2001 Administration Short written homeworks each week First one today Web page is up with first lecture Send me (mlittman@cs) your email address so I can make a mailing list Office hours… What’s AI? (to me) Computers making decisions in real-world problems Search Problems Let S be the set of states (strings) Input: Initial state: s0 Neighbor generator, N: S ? 2S Goal function, G: S ? {0,1} Search Answer s1,…,sn such that: s1,…,sn ? S for all 1?i?n, si ? N(si-1) G(sn) = 1 Examples We’re very impressed. Meaning? Rush Hour 8-puzzle Logistics 8-queens problem Logic puzzles Job-shop scheduling Rush Hour Move cars forward and backward to “escape” Search Version States: configurations of cars N(s): reachable states G(s): 1 if red car at gate 8-puzzle Slide tiles into order States: N(s): G(s): Logistics Very sophisticated. What goes where when? Desert Storm logistics “paid for AI research” 8 Queens Puzzle No captures States: N(s): G(s): Logic Puzzles Jody, who is an ape, wasn’t the ape who returned immediately after Tom and immediately before the animal who appeared in the movie with no rating. The only lions that were used in the movies were the one who was the third to return, the one who appeared in the R movie, and the one who appeared in “Luck”. … Job-Shop Scheduling Industrial problem: Allocate machines and machinists to time slots Constraints on orders in which parts are serviced Search Template fringe = {(s0, 0)}; /* initial cost */ markvisited(s0); While (1) { If empty(fringe), return failure; (s, c) = removemincost(fringe); If G(s) return s; Foreach s’ in N(s) if unvisited(s’) fringe = fringe U {(s’, cost(s’)}; markvisited(s0); } Data Structures How implement this efficiently? removemincost-U-empty? markvisited-unvisited? Vary Cost How does search behavior change with cost? cost(s’) = c + 1 cost(s’) = c - 1 Grid Example: BFS Grid Example: DFS How Eva