Solving Problem by Searching BCMI Homepage通过搜索 BCMI主页解决问题.pptVIP

Local beam search Keep track of k states rather than just one Start with k randomly generated states At each iteration, all the successors of all k states are generated If any one is a goal state, stop; else select the k best successors from the complete list and repeat. Genetic algorithms Genetic Algorithm Genetic algorithms Local Search in Continuous Spaces First Project: 8-queens Problem To formulate 8-queens problem into the search problem in a state space To define a heuristic function To implement A* Algorithm to find solutions To write a report on the simulation result. Questions? What further problems will we meet? Constraints Multi-agents Uncertainty The Go Text Protocol(GTP) http://www.lysator.liu.se/~gunnar/gtp/ /projects/gogui/ End of the Talk * * * * Shanghai Jiao Tong University Informed Search and Exploration Outline Best-first search Greedy best-first search A* search Heuristics Local search algorithms Hill-climbing search Simulated annealing search Local beam search Genetic algorithms Review: Tree search \input{\file{algorithms}{tree-search-short-algorithm}} A search strategy is defined by picking the order of node expansion Best-first search Idea: use an evaluation function f(n) for each node estimate of desirability Expand most desirable unexpanded node Implementation: Order the nodes in fringe in decreasing order of desirability Special cases: greedy best-first search A* search Romania with step costs in km Greedy best-first search Evaluation function f(n) = h(n) (heuristic) = estimate of cost from n to goal e.g., hSLD(n) = straight-line distance from n to Bucharest Greedy best-first search expands the node that appears to be closest to goal Properties of greedy best-first search Complete? No – can get stuck in loops, e.g., Iasi ? Neamt ? Iasi ? Neamt ? Time? O(bm), but a good heuristic can give dramatic improvement Space? O(bm) -- keeps all nodes in memory Optimal? No A* search Idea: