CNS using restricted space algorithms for finding a shortest path

These days, due to the heavy traffic, it is very difficult for drivers in big cities to find an easy and efficient route to a selected destination. Thus, route guidance has become a very important problem for drivers. As a result, car navigation systems are commonly installed in new vehicles. These systems are capable of performing some of the tasks traditionally performed by driver, such as reading the map and determining the best route to the destination. The process of finding optimum path from one point to another is called routing. The suggested algorithm is improved version of dijkstra algorithm that can search for the shortest path at a restricted search space. The search space is restricted by the use of a rectangle or a static and dynamic hexagon. These methods can improve run time and usaged memory because the visited nodes and edges are limited. In order to show the effectiveness of the proposed algorithm, it is tested on the city map of Gurgaon. Following, this result is compared to the result obtained with dijkstra's algorithm