人工智能05约束满足问题.ppt

第五章约束满足问题  Review: Last Chapter Best-first search Heuristic functions estimate costs of shortest paths Good heuristics can dramatically reduce search cost greedy best-first search expands lowest h incomplete and not always optimal A* search expands lowest g+ h complete and optimal -also optimally efficient (up to tie-breaks, for forward search Admissible heuristics can be derived from exact solution of relaxed  Review: Last Chapter Local search algorithms the path to the goal is irrelevant; the goal state itself is the solution keep a singlecurrent state try to improve it lill-climbing search depending on initial state, can get stuck in local maxima Simulated annealing search escape local maxima by allowing somebadmoves but gradually decrease their frequency Local beam search Keep track of k states rather than just one Genetic algorithms  本章大纲 · CSP examples Backtracking search for CSPs Problem structure and problem decomposition Local search for csps  Constraint satisfaction problems(CSPs Standard search problem state is ablack box-any old data structure that supports goal test al. successor 任何可以由目标测试、评价函数、后继函数访问的数据结构 state is defined by variables X with values from domain (X)D goal test is a set of constraints specifying allowable combinations of values for subsets of variables 每个约束包括一些变量的子集,并指定这些子集的值之间允许进行的 合并 Simple example of a formal representation language(形式化表示方法) Allows useful general- purpose(通用的,而不是问题特定的) algorithms with more power than standard search algorithms  Example: Map-Coloring Northern Territory Western New South wale victoris Tasmania 变量 WA, NT O, NSWV SA,T 值域D={red,gren,b/uej 约束: adjacent regions must have different colors e.g., WA NT, or(if the language allows this), or (WA, NT)E i(red, green), (red, blue),(green, red), (green, blue).)  Example: Map-Coloring Northern New South Waks Solutions are assignments satisfying all constraints, e. g (WA=red, NT=green, Q=red, NSW=green, V =red SA