Advertisement

High Precision 3D Indoor Routing on Reduced Visibility Graphs

Chapter
Part of the Lecture Notes in Geoinformation and Cartography book series (LNGC)

Abstract

Indoor navigation is becoming a most wanted application especially on the background of the wide availability of powerful personal mobile devices and new methods for indoor positioning. Existing approaches do seldom incorporate that people can move freely through e.g. big halls and are not constrained to specific lanes as vehicles are on road networks. Thereby these approaches can only approximate shortest paths and cannot benefit from possible highly accurate indoor positioning methods. In this chapter we show how the concept of visibility graphs can be applied to indoor routing and how it results in highly accurate shortest paths. We demonstrate how any accurate position can be incorporated in the automatically constructed graph. Furthermore we show how the knowledge that different levels of a building are usually sparsely interconnected can be used to speed up the well-known shortest path algorithm A* by introducing a new heuristic. In experiments we show that our approach needs 29 % less run-time than a standard A*-algorithm.

Keywords

Indoor routing Visibility graph Heuristic Shortest path 

Notes

Acknowledgments

The author would like to thank Bernhard Steuer for the visualisation of the data in Figs. 5 and 6.

References

  1. Ariza-Villaverde AB, de Ravé EG, Jiménez-Hornero FJ, Pavón-Domínguez P, Muñoz-ermejo F (2010) Introducing a geographic information system as computer tool to apply the problem-based learning process in public buildings indoor routing. Comput Appl Eng Educ. doi: 10.1002/cae.20442
  2. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269–271CrossRefGoogle Scholar
  3. Evennou F, Marx F (2006) Advanced integration of WIFI and inertial navigation systems for indoor mobile positioning. EURASIP J Appl Signal Process 2006:1–11Google Scholar
  4. Goetz M, Zipf A (2011) Formal definition of an user-adaptive and length-optimal routing graph for complex indoor environments. Geo-spatial Inf Sci 14(2):119–128CrossRefGoogle Scholar
  5. Hagedorn B, Trapp M, Glander T et al. (2009) Towards an indoor level-of-detail model for route visualization. Proceeding 10th International Conference on Mobile Data Management: systems services and middleware 692–697Google Scholar
  6. Haklay M, Weber P (2008) Open street map: user-generated street maps. IEEE Pervasive Comput 7(4):12–18CrossRefGoogle Scholar
  7. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107CrossRefGoogle Scholar
  8. Karimi HA, Ghafourian M (2010) Indoor routing for individuals with special needs and preferences. Trans GIS 14(3):299–329CrossRefGoogle Scholar
  9. Latombe JC (1991) Robot motion planning. Kluwer Academic Publishers, BostonCrossRefGoogle Scholar
  10. Lozano-Pérez T, Wesley MA (1979) An algorithm for planning collision-free paths among polyhedral obstacles. Commun ACM 22:560–570CrossRefGoogle Scholar
  11. May AJ, Ross T, Bayer SH, Tarkiainen MJ (2003) Pedestrian navigation aids: information requirements and design implications. Pers Ubiquit Comput 7(6):331–338CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Fachgebiet GeoinformationssystemeTechnische Universität MünchenMunichGermany

Personalised recommendations