| 基于典型事例推理的路径规划方法研究(英文) |
| |
| 引用本文： | 翁敏,魏秀琴,瞿嵘,蔡忠亮.基于典型事例推理的路径规划方法研究(英文)[J].地球空间信息科学学报,2009,12(1):66-71. |
| |
| 作者姓名： | 翁敏 魏秀琴 瞿嵘 蔡忠亮 |
| |
| 作者单位： | School;Resource;Environment;Science;Wuhan;University;Laboratory;GeographicInformation;System;Ministry;Education; |
| |
| 基金项目： | Supported by the National 863 program of China (No. 2006AA12Z202) |
| |
| 摘 要： |
|
| 关 键 词： | 典型 路径规划 方法研究 事例推理 |
A path planning algorithm based on typical case reasoning |
| |
| Min Weng,Xiuqin Wei,Rong Qu,Zhongliang Cai.A path planning algorithm based on typical case reasoning[J].Geo-Spatial Information Science,2009,12(1):66-71. |
| |
| Authors: | Min Weng Xiuqin Wei Rong Qu Zhongliang Cai |
| |
| Institution: | (1) School of Resource and Environment Science, Wuhan University, 129 Luoyu Road, Wuhan, 430079, China;(2) Key Laboratory of Geographic Information System, Ministry of Education, Wuhan University, 129 Luoyu Road, Wuhan, 430079, China |
| |
| Abstract: | 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. |
| |
| Keywords: | path planning case-based reasoning typical case |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
|
