High Precision 3D Indoor Routing on Reduced Visibility Graphs
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.
KeywordsIndoor routing Visibility graph Heuristic Shortest path
- 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
- 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
- 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