文章基本信息

标题：A path planning algorithm based on typical case reasoning
本地全文：下载
作者：Min Weng ; Xiuqin Wei ; Rong Qu 等
期刊名称：Geo-spatial Information Science
印刷版ISSN：1009-5020
电子版ISSN：1993-5153
出版年度：2009
卷号：12
期号：1
页码：66-71
DOI：10.1007/s11806-009-0185-1
出版社：Taylor and Francis Ltd
摘要：Case-based reasoning is an AI technique in which the previous solutions are stored for future use. People are used to guiding themselves according to those routes that are stored in their memories and have been used by them before. It is just based on people’s preference to familiar routes, which are gained through the study of the cognitive activities. We propose to apply the intelligent method based on the case reasoning to path planning. It is impossible for a case base to store all the solutions to all the shortest paths; therefore, part of them should be stored. However, which routes should be stored and which should not be? How do we adapt the cases that have already been stored and how do we acquire the shortest route based on them? All these issues need to be explained by integrating knowledge of the network on account of case-based reasoning techniques. This paper suggests the case-based reasoning in another point. This means finding some irreplaceable links on the basis of the complete analysis of the problems space, which are called the must_be_passed link between the source and destination. Merely compute the shortest path case from those best exit/entry nodes of the grids to the irreplaceable links, and then add them into the case base storing for future use. This method is based on case-based reasoning technique and completely considers the properties of the problem space. In addition to the use of knowledge of the natural grid in the route network, this method is more efficient than existing algorithms on computing efficiency.
关键词：path planning; case-based reasoning; typical case