Abstract
Routing on mobile devices is only restrictedly realizable, because of the limited resources (memory, processor performance). On the other hand, until recently only financially strong companies were able to provide solutions for this problem because of the high costs of the geographic data involved in this task. We propose a solution consisting of a combination of hierarchical routing and shortest path bidirectional A* algorithm. When tested on the Austrian street map, our method solved routing problems about ten times faster than Dijkstra algorithm. The underlying data structure for the geo-data on the mobile device is a modified quad-tree. The basic street data has been extracted from OpenStreetMap (OSM), a project started in 2004 which provides free geographic data.
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
Canalys: Expert analysis for the high-tech industry (2010), http://www.canalys.com/
Breymann, U., Mosemann, H.: Java ME-Anwendungsentwicklung für Handys, PDA und Co, Band 2 der Reihe 2. Auflage. Carl Hanser Verlag München Wien, Google Online Books Auflage (May 2008); ISBN: 978-3-446-41376-4
Teschl, G., Teschl, S.: Mathematik für Informatiker - Band 1: Diskrete Mathematik und Lineare Algebra, vol. 2. Springer, Berlin (2007)
Dumke, R.: Algorithmen und Datenstrukturen. Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik Institut für Verteilte Systeme, AG Softwaretechnik (2001), http://www-ivs.cs.uni-magdeburg.de/~dumke/-EAD/Skript41.html
Stout, E.Q., Stout, Q.F., De Zeeuw, D.L., Gombosi, T.I., Groth, C.P.T., Marshall, H.G., Powell, K.G.: Adaptive Blocks: A High Performance Data Structure. University of Michigan (1997)
Schultes, D.: Fast and exact shortest path queries using highway hierarchies. Master’s thesis, Universität des Saarlandes (2005)
Jagadeesh, G.R., Srikanthan, T., Quek, K.H.: Heuristic techniques for accelerating hierarchical routing on road networks. IEEE Transactions on Intelligent Transportation Systems Band 3, 301–309 (2002); ISSN: 1524-9050
Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search meets graph theory. In: Proceedings 16th Annual ACM-SIAM Symposium, pp. 156–165 (2005)
Schultes, D.: Route Planning in Road Networks. Doktor der Naturwissenschaften, Universität Fridericiana zu Karlsruhe (February 2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kastner, KH., Ostermayer, G. (2012). Routing with Free Geodata on Mobile Devices. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27579-1_71
Download citation
DOI: https://doi.org/10.1007/978-3-642-27579-1_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27578-4
Online ISBN: 978-3-642-27579-1
eBook Packages: Computer ScienceComputer Science (R0)