Abstract
This paper is concerned with online personalized navigation services for road network systems in India. We study it as a path cost optimization problem on semi-structured graphs. Existing online services like Google Maps and Live Search Maps do not yet provide road navigation for India. Our strategy is based on the cognitive clustering process that humans use for finding a route between a source-destination pair over a real road network. A semi-automatic web based tool has been developed for collaborative community assisted creation of road maps by leveraging Google Maps services. Our experiments over real route maps indicate that the proposed algorithm performs very well with caching and provides more accurate navigational directions when compared with available web-based map services for Indian road network system.
This research is sponsored by generous grants from MHRD, Govt of India and Microsoft open source technology project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Car, A., Frank, A.U.: Modelling a hierarchy of space applied to large road networks. In: IGIS Workshop (1994)
Dai, L., Maheshwari, A.: Fast shortest path algorithms for road networks (2005)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik, 269–271 (1959)
Hart, P.E., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybermetrics, 100–107 (1968)
Jagadeesh, G.R., Srikanthan, T., Quek, K.H.: Heuristic techniques for accelerating hierarchical routing on road networks. IEEE Transactions on Intelligent Transportation Systems 3 (December 2002)
Jain, S.: Location-aware navigation using mobile devices and the internet. Master’s thesis, IIT Kanpur (May 2008)
Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering 14 (September/October 2002)
Lim, Y., Kim, H.: Shortest path algorithm for real road network based on path overlap. Journal of Eastern Asia Society for Transportation Studies (2005)
Park, C., Sung, K., Doh, S., Park, S.: Finding a path in hierarchical road networks. In: IEEE Intelligent Transportation Systems Conference Proceedings (August 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Ghosh, R.K. (2008). A Web Based Pathfinder Service for Road Networks in India. In: Parashar, M., Aggarwal, S.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2008. Lecture Notes in Computer Science, vol 5375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89737-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-89737-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89736-1
Online ISBN: 978-3-540-89737-8
eBook Packages: Computer ScienceComputer Science (R0)