摘要
搜索是人工智能中的一个基本问题。文中比较了几种典型的搜索方法,包括盲目搜索和启发式搜索,重点对A 算法进行了阐述和分析,并以求地图两点的最短路径搜索为例,给出了用A 算法编程的实现方法。结果表明,应用A 算法提高了目标搜索的效率。
Compares with the features of some search m ethods, including blind search and heuristic search, and especially discusses an d analyses A* algo rithm .The writer provides a program about search the shortest path between two points based on graph search. The result demonstrate that A* algorithm ca n improve the efficiency of search.
出处
《微机发展》
2003年第5期33-35,共3页
Microcomputer Development
