HeuristicSearch课程.pptVIP

Heuristic Search Introduction toArtificial Intelligence COS302 Michael L. Littman Fall 2001 Administration Thanks for emails to Littman@cs! Test message tonight… let me know if you don’t get it. Forgot to mention reading… (sorry). AI in the News “Computers double their performance every 18 months. So the danger is real that they could develop intelligence and take over the world.” Eminent physicist Stephen Hawking, advocating genetic engineering as a way to stay ahead of artificial intelligence. [Newsweek, 9/17/01] Blind Search Last time we discussed BFS and DFS and talked a bit about how to choose the right algorithm for a given search problem. But, if we know about the problem we are solving, we can be even cleverer… Revised Template fringe = {(s0, f(s0)}; /* 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 s’ in fringe, reduce cost if f(s’) smaller; else if unvisited(s’) fringe U= {(s’, f(s’)}; markvisited(s’); } Cost as True Distance Some Notation Minimum (true) distance to goal t(s) Estimated cost during search f(s) Steps from start state g(s) Estimated distance to goal (heuristic) h(s) Compare to Optimal Recall b is branching factor, d is depth of goal (d=t(s0)) Using true distances as costs in the search algorithm (f(s)=t(s)), how long is the path discovered? How many states get visited during search? Greedy True distance would be ideal. Hard to achieve. What if we use some function h(s) that approximates t(s)? f(s) = h(s): expand closest node first. Approximate Distances We saw already that if the approximation is perfect, the search is perfect. What if costs are +/- 1 of the true distance? |h(s)-t(s)| ? 1 Problem with Greedy Four criteria? Algorithm A Discourage wandering off: f(s) = g(s)+h(s) In words: Estimate of total path cost: cost so far plus estimated completion cost Search along the most promising path (not node) A Behaves Better Onl