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.
Similar content being viewed by others
References
Deo N, Pang C Y(1984) Shortest-path algorithms: taxonomyand annotation [J]. Networks, 14: 275–323
Zhan F B, Noon C E (1998) Shortest path algorithms: an evaluation using real road networks[J] Transport. Sci., 32(1): 65–73
Karimi H A (1996) Real-time optimal route computation: a heuristic approach[J] TS J., 3(2):111–127
Lu Feng, Lu Dongmei, Cui Weihong(1999) Time shortest pa th algor ithm for restricted search ing area in transportation networks[J]. Jou rnal of Im age and Graph ics, 4A(10): 849–853
Car A, Frank AU (1994) General principles of hierarchical spatial reasoning — the case of wayfinding[C] Proceedings of Sixth Int. Symposium on Spatial Data Handling, Edinburgh, Scotland
Weng Min, Wu Hehai, Du Qingyun, et al.(2006) A heuristic and hierarchical wayfinding algorithm based on the knowledge of road network[J]. Geomatics and Information Science of Wunan University, 31(4):360–363
Zhu Fuxi, Tang Yiqun, Fu Jianming(2002) Artificial intelligence principle [M].Wuhan: Wuhan University Press
Weng Min (2006) Research on criteria of route selection and methods of wayfinding in the cognitive space of transportation networks[D] Wuhan: Wuhan University
Anwar M A, Yoshida (2001) Integrating OO road network database, cases and knowledge for route finding[C]. SAC2001, Toronto
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National 863 program of China (No. 2006AA12Z202).
About this article
Cite this article
Weng, M., Wei, X., Qu, R. et al. A path planning algorithm based on typical case reasoning. Geo-spat. Inf. Sci. 12, 66–71 (2009). https://doi.org/10.1007/s11806-009-0185-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11806-009-0185-1