High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Intelligent Route Finding System using M Star Algorithm

Author(s):

Madhu Amarnath , R.M.K. College of Engineering and Technology; Sankar Palanisamy, Tata Consultancy Services

Keywords:

Dijkstra’s Algorithm, Route finding

Abstract

The increased traffic and complex modern road network have made finding a good route from one location to another a difficult task. There are many search algorithms that have been proposed to solve this problem. The most well-known among them are Dijkstra’s algorithm, and A*. While these algorithms are effective for route finding, they are wasteful in terms of computational overhead. In this paper a novel algorithm M*(pronounced as M Star) is suggested for intelligent route finding which uses better evaluation criteria and the notion of cumulative proximity score. This proposed technique will reduce the time and space requirements in computation, and also produces better result in terms of accuracy and shortness of path found.

Other Details

Paper ID: IJSRDV3I2774
Published in: Volume : 3, Issue : 2
Publication Date: 01/05/2015
Page(s): 1007-1009

Article Preview

Download Article