Using Knowledge to Isolate Search in Route Finding

Traveling is a part of every person's day-to-day life. With the massive and complicated road network of a modern city (or country), finding a good route to travel from one place to another is not a simple task. In Network Theory, this is the shortest path problem. Shortest path algorithms are often used to solve the problem. However, these algorithms are wasteful in terms of computation when applied to the route finding task. They may also produce solutions that are not suitable for human drivers. In this paper, we present an approach that uses knowledge about the road network to substantially reduce the time and space required in computation, and to ensure human oriented solutions. Within this framework, three alternative methods are proposed, which may be used in different situations. A system has also been implemented for route finding in Singapore.

[1]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[2]  P. Gács,et al.  Algorithms , 1992 .

[3]  Bing Liu,et al.  Finding the shortest route using cases, knowledge, and Djikstra's algorithm , 1994, IEEE Expert.

[4]  Ernest Davis,et al.  Planning routes through uncertain territory , 1983 .

[5]  Benjamin Kuipers,et al.  Modeling Spatial Knowledge , 1978, IJCAI.

[6]  Ashok K. Goel,et al.  Representation, organization, and use of topographic models of physical spaces for route planning , 1991, [1991] Proceedings. The Seventh IEEE Conference on Artificial Intelligence Application.

[7]  Jacob Shapiro,et al.  Level graphs and approximate shortest path algorithms , 1992, Networks.

[8]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[9]  Drew McDermott,et al.  Planning Routes Through Uncertain Territory , 1983, Artif. Intell..

[10]  Frederick Hayes-Roth,et al.  Building expert systems , 1983, Advanced book program.

[11]  Jeffery L. Kennington,et al.  The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm , 1993, Comput. Optim. Appl..

[12]  Bing Liu,et al.  Finding the Shortest Route Using Cases, Knowledge, and Djikstra's Algorithm , 1994, IEEE Expert.

[13]  Tod S. Levitt,et al.  Qualitative Navigation for Mobile Robots , 1990, Artif. Intell..

[14]  G. Gallo,et al.  SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[15]  Gerhart F King,et al.  EXCESS TRAVEL: CAUSES, EXTENT, AND CONSEQUENCES , 1987 .

[16]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.