Informed Search 吉建民 USTC jianminOustc.edu.cn 2022年3月14日 4口◆4⊙t1三1=，￥9QC
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Informed Search 吉建民 USTC jianmin@ustc.edu.cn 2022 年 3 月 14 日
Used Materials Disclaimer:本课件采用了S.Russell and P.Norvig's Artificial Intelligence-A modern approach slides,.徐林莉老师课件和其他网 络课程课件，也采用了GitHub中开源代码，以及部分网络博客 内容 口卡4三4色进分QC
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Used Materials Disclaimer: 本课件采用了 S. Russell and P. Norvig’s Artificial Intelligence –A modern approach slides, 徐林莉老师课件和其他网 络课程课件，也采用了 GitHub 中开源代码，以及部分网络博客 内容
Table of Contents 课程回顾 Best-first Search(最佳优先搜索 Greedy search A search Local Search Algorithms Hill-climbing search Simulated annealing search Local beam search Genetic algorithms 口◆4日1三1=，是90C
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Table of Contents 课程回顾 Best-first Search (最佳优先搜索) Greedy search A* search Local Search Algorithms Hill-climbing search Simulated annealing search Local beam search Genetic algorithms
课程回顾 function TREE-SEARCH(problem,fringe)returns a solution,or failure fringe -INSERT(MAKE-NODE(INTIAL-STATE[problem]),fringe) loop do if fringe is empty then return failure node--REMOVE-FRONT (fringe) if GOAL-TEST[problem]applied to STATE(node)succeeds return node fringe INSERTALL(EXPAND(node,problem),fringe) A strategy is defined by picking the order of node expansion Variety of uninformed search strategies Iterative deepening search uses only linear space and not much more time than other uninformed algorithms 口卡回·三4色，是分Q0
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 课程回顾 ▶ A strategy is defined by picking the order of node expansion ▶ Variety of uninformed search strategies ▶ Iterative deepening search uses only linear space and not much more time than other uninformed algorithms
Uninformed search strategies Uninformed search strategies use only the information available in the problem definition ·Breadth-first search(广度优先搜索) ,Uniform-cost search(代价一致搜索) ·Depth-first search(深度优先搜索) ~Depth-limited search(深度有限搜索) ,Iterative deepening search(迭代深入深度优先搜索) Bidirectional search(双向搜索) 口◆4日1三1，是90C
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Uninformed search strategies Uninformed search strategies use only the information available in the problem definition ▶ Breadth-first search (广度优先搜索) ▶ Uniform-cost search (代价一致搜索) ▶ Depth-first search (深度优先搜索) ▶ Depth-limited search (深度有限搜索) ▶ Iterative deepening search (迭代深入深度优先搜索) ▶ Bidirectional search (双向搜索)