Uninformedsearch无信息搜索除了问题中提.PDFVIP

1  Uninformed search无信息的搜索：除了问题中提 供的定义之外没有任何关于状态的附加信息。  Informed search有信息的搜索：在问题本身的定 义之外还可利用问题的特定知识。 /~linlixu/ai2018spring/ Review: Last Class 2 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 /~linlixu/ai2018spring/ Uninformed Search Strategies 3 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 （迭代深入深度优先搜索） /~linlixu/ai2018spring/ Uninformed Search Strategies 4  Summary of uninformed tree (problem-solving) search: Algorithms differ by method of expansion, or choice of state-action sequence for offline evaluation  Complexity tradeoffs, but poor (worst case or typical case) performance from all when state space is large /~linlixu/ai2018spring/ 5 Informed Search Algorithms Chapter 4 /~linlixu/ai2018spring/ Outline 6  Best-first search （最佳优先搜索）  Greedy best-first search