Lecture 4 Optimal and Heuristic Search讲座4最佳和启发式搜索.pptVIP

Lecture 4: Informed Heuristic Search ICS 271 Fall 2008 Overview Heuristics and Optimal search strategies heuristics hill-climbing algorithms Best-First search A*: optimal search using heuristics Properties of A* admissibility, monotonicity, accuracy and dominance efficiency of A* Branch and Bound Iterative deepening A* Automatic generation of heuristics Problem: finding a Minimum Cost Path Previously we wanted an arbitrary path to a goal or best cost. Now, we want the minimum cost path to a goal G Cost of a path = sum of individual transitions along path Examples of path-cost: Navigation path