2015AI课件lec3盲目搜索.pptVIP

Comparing Search Strategies b：分支因子（ b 是有限的是上述算法完备性的前提条件） d：最浅的解深度 m：搜索树最大深度 l：深度限制 Homework 8.1 8.2 2012+ * 2012+ * 2012+ * 2012+ * 2012+ * * 2012改 * 2012+ * 2012+ * * Why uniform-cost search? Breadth-first search Advantage Finds the path of minimal length to the goal. Disadvantage Requires the generation and storage of a tree whose size is exponential the depth of the shallowest goal node Uniform-cost search [Dijkstra 1959] Expansion by equal cost rather than equal depth Uniform-Cost Search 开始 把S放入OPEN表 OPEN表为空表？ 把第一个节点(n)从OPEN表移至CLOSED表 n为目标节点吗？ 把n的后继节点m放入OPEN表计算g(m) 修改返回节点n的指针 失败 成功 是 是 否 否 按g值升序重排OPEN表 g(m)=g(n)+c(n,m) Uniform-Cost Search Uniform-Cost Search Uniform-Cost Search Breadth-first search Minimal depth Uniform-cost search Minimal cost If each the cost of each step is equal, breadth-first search is equal to uniform-cost search. Breadth-first search is a special case of uniform-cost seach Uniform-Cost Search 性能分析 完备性：YES（分支因子有限） 最优性：YES（按照start到节点的代价来扩展） 时间复杂度： 空间复杂度： C*：最优解的代价 the cost of the optimal solution. E: 所有弧的最小代价 the minimum cost of any arc. 8 Depth-First Search Backtracking search Depth-First Search Backtracking search Procedure Generates the successor of a node just one at a time by apply individual operator. At each node a decision must be made about which operator to apply first, which next, and so on. Repeats this process until the leaves or depth bound. Depth bound: No successor is generated whose depth is greater than the depth bound. Example of depth-First Search： Eight-Puzzle Start Goal 8-puzzle example Depth bound: 5 Operator order: left ? up ? right ? down 8-puzzle example The graph when the goal is reached in depth-first search. Formal description of depth-first Search Set N (OPEN) to be a list of initial nodes. If N is empty, then exit and signal failure. Set n to be the first node in N, and remove n from N (and add n to CLOSED). If n is a goal node, then exit and signal success. Otherwise, add