搜索问题建模模型.ppt

中南大学 智能系统与智能软件研究所 State Space and Search Strategies状态空间及其搜索策略 图搜索算法： 例子 Acknowledgment Tim Smith, Luc De Raedt, Yun Peng /slides-ppt/ /classes/2004cs460/notes/ http://www.cs.ualberta.ca/~lindek/366/slides/ 补充读物：Nils J. Nilsson著, 郑扣根 庄越挺译 Artificial Intelligence A New Synthesis 机械工业出版社 2000 Genetic Algorithms Population of individuals (each individual is represented as a string of symbols: genes and chromosomes) Fitness function: estimates the goodness of individuals Selection: only those with high fitness function values are allowed to reproduce Reproduction: crossover allows offsprings to inherit good features from their parents mutation (randomly altering genes) may produce new (hopefully good) features bad individuals are throw away when the limit of population size is reached To ensure good results, the population size must be large starts out high and gradually (very slowly) decreases toward 0. population selection of parents for reproduction (based on a fitness function) parents reproduction (cross-over + mutation) next generation of population The 8 queens problemRepresentation 1 2 3 4 5 6 7 8 Genotype 基因型: a permutation of the numbers 1 - 8 Phenotype 显型: a board configuration Obvious mapping Genetic algorithms Fitness function: number of non-attacking pairs of queens (min = 0, max = 8 × 7/2 = 28) 24/(24+23+20+11) = 31% 23/(24+23+20+11) = 29% etc Parent selection: Roulette wheel selection, for instance Survivor selection (replacement) When inserting a new child into the population, choose an existing member to replace by: sorting the whole population by decreasing fitness enumerating this list from high to low replacing the first with a fitness lower than the given child Note: selection works on fitness values, no need to adjust it to representation The 8 queens problemSelection E.g. roulette wheel selection fitness(A) = 3 fitness(B) = 1 fitness(C) = 2 A C 1/6 = 17% 3/6 = 50% B 2/6 = 33% The 8 queens pr