【作者】 杨明辉；

【导师】 胡家宝；

【作者基本信息】 武汉理工大学 ， 计算机软件与理论， 2008， 硕士

【摘要】 人工智能是计算机研究的一个热点问题,它的应用非常的广泛,而基于人工智能的搜索具有良好的应用前景,本论文就是在传统的搜索算法的基础上,经过仔细分析它的优缺点,继承其优点,同时对其缺点进行改进而成。相对于传统的搜索方式,本设计使搜索的服务能力和服务质量有了明显的提升。本论文的研究目标,是通过研究搜索在实际中的共同特征,从而找出一个能解决该类问题的一个大致通用的方法。然后根据该方法设计一个智能搜索系统,该系统具有人类的判断能力,能根据事先约定的规则,将常人难以实现的推理过程清晰地,准确地,快速地推理出来。该系统可以解决这样一类性质的问题:给出事物的初始状态,事物最终需要达到的状态,给出系统中各个成员的运行方式,然后根据以上的条件在每一轮格局下对每个成员进行判断,如果该成员可以“移动”,就移动它,然后进行下一轮的判断。本设计的具体表现是:以推箱子游戏为表现形式,给出游戏规则,然后让计算机“找出”推箱子的一条路径。并从中总结出解决类试问题的一般方法。本设计的特点是:与传统的搜索相比,本搜索可以对某处进行重复搜索。传统的搜索算法对某点的搜索是“一次性”的,即访问某处后无法进行二次访问。这就大大缩小了其实际应用的领域。本搜索算法不断可以自动搜索,还可以在实际情况需要的时候原路返回,这样就大大提高了其实际应用的范围。更多还原

【Abstract】 The artificial intelligence is a hot topic in the field of computer research, and it’s application sphere is very broad, and the search based on artificial intelligence has a good application prospect. My paper is based on the traditional searching algorithm , analyzes its good and bad points carefully, inherits its merit, and makes the improvement to its shortcoming to it’s being. Compared with the traditional searching algorithm, the search serviceability and the grade of service have a obvious promotion.My thesis is to design a intelligence search system, which can exactly, swiftly realize inference process according to the rule which agrees beforehand after a research on the common traits of search. The system can solve such a kind of problem. If the initial state of things is known, the final state of things is knows, the mode of operation for each unit is known, so we can judge each unit according to the above conditions. If the members can "move", moving it and then proceed to the next round of the judgment. This design’s concrete manifestation is to play the game of pushing boxes. Computer must find a path by which boxes can be pushed to the proper positions, and this path must be the shortest, and find a solution to the problem similar to this.My thesis’s highlight lies in: compared with the traditional search, this search can visit certain spots redundantly. The traditional search algorithm can visit one spot only once, can’t visit it twice, which reduce it’s application field. This algorithm can not only visit automaticly, but also can return if necessary, so it’s application field can be broadened.更多还原