An Advanced Algorithm for Finding Shortest Path in Car Navigation System
(0) Finding an efficient route is difficult problem for many drivers.Car Navigation Systems are sometimes offered as a special feature on new cars.These systems are capable of performing some of the tasks traditionally performed by driver,such as determining the best route to the destination.The process of finding optimum path from one point to another,is called routing.In this paper,a new shortest path algorithm is proposed.The suggested algorithm is a modified version of dijkstra,which states that 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 maps of Arak and Tehran.Following,this result is compared to the result obtained with dijkstras algorithm.
shortest path Geometrical figures Car Navigation System
Sara nazari M. Reza Meybodi M.ali salehiGh Sara taghipour
Computer Engineering Department,Islamic Azad university-Arak branch ,Iran Amirkabir University of Technology-Tehran,Iran industrial estates company of arak,Iran Computer Engineering Department,Islamic Azad university-Arak branch,Iran
国际会议
武汉
英文
2008-11-01（万方平台首次上网日期，不代表论文的发表时间）