《A路径寻找算法的研究》》-毕业论文.doc

A*算法的研究与设计 摘 要 A*算法在计算机人工智能领域有着广泛的应用, 本文主要研究在路径寻找中的应用,通过暴力搜索,贪心式搜索、纯启发式搜索之间的代码实现复杂度、空间和时间上的比较，介绍贪心和启发式搜索的结合搜索，即A*搜索的优点，并以直观的方式展现出来——在设计的寻路小游戏中，可以手动绘制障碍物地图，并在同一地图分别运行四种不同的算法，通过对各个算法结束遍历过的点进行染色直观地展示各算的耗时和最优解情况。 最后再进一步对A*搜索思想的研究，引出A*搜索的变形，IDA*搜索、B*搜索以及D*搜索。相比A*搜索，IDA*可以节省更多的空间(比如IDA*可以解决A*无法实现的15数码问题)，而D*搜索在障碍物不停变化的地图中通过动态估价可以避免每走一步就需要反复调用A*算法。 关键词： 路径寻找 贪心搜索，启发式，A*搜索，IDA*搜索，D*搜索； A * Algorithm Research and Design Abstract A* algorithm paly an important role in the field of computer artificial intelligence，In this Paper,We mainly study its application in Path-Finding ,Let’s view on the advantages and disadvantages of A* algorithm which’s Composed by Greedy search and Heuristic search, according to the compare of violence search, greedy search, pure heuristic,and they have different code realization of complexity and comparison of space and time, In the Finding path game we can draw a map with obstacles,and run the four different algorithms on it , based on each end of the ergodic algorithm point after dyeing vividly reveals the time-consuming and calculate the optimal solution. Finally, we make a further research on A* s idea,and we also care about the Variations of A* ,such as,the IDA* search algorithm ,the B* search algorithm,and the D* algorithm. Compared with A*, IDA* can save much space cost(for example ,IDA* can solve the 15 digital game problem ,but not A star ),and D* do well in the map with obstacles and constantly changing by dynamic evaluation ,so it can avoid each step to call A * algorithm. Keyword: Finding Path , Greedy Search, Heuristic Search, A* Search ，D*search 目 录 TOC \t 样式1,1,样式2,2 1绪 论 PAGEREF _Toc263768625 \h 1 1.1 A*算法在路径寻找中的运用 PAGEREF _Toc263768626 \h 1 1.2 何谓启发式搜索 PAGEREF _Toc263768627 \h 1 1.3 A*算法原理 PAGEREF _Toc263768628 \h 2 1.4 论文内容安排 PAGEREF _Toc263768629 \h 2 2不同算法路径寻找中的对比 PAGEREF _Toc263768630 \h 2 2.1 最普通的暴力搜索 PAGEREF _Toc263768631 \h 3 2.2 贪心搜索 PAGEREF _Toc263768632 \h 6 2.3 纯启发式搜索 PAGEREF _Toc263768633