Formal Definition of a User-Adaptive and Length-Optimal Routing Graph for Complex Indoor Environments

Car routing solutions are omnipresent and solutions for pedestrians also exist. Furthermore, public or commercial buildings are getting bigger and the complexity of their internal structure has increased. Consequently, the need for indoor routing solutions has emerged. Some prototypes are available, but they still lack semantically-enriched modelling (e.g., access constraints, labels, etc.) and are not suitable for providing user-adaptive length-optimal routing in complex buildings. Previous approaches consider simple rooms, concave rooms, and corridors, but important characteristics such as distinct areas in huge rooms and solid obstacles inside rooms are not considered at all, although such details can increase navigation accuracy. By formally defining a weighted indoor routing graph, it is possible to create a detailed and user-adaptive model for route computation. The defined graph also contains semantic information such as room labels, door accessibility constraints, etc. Furthermore, one-way paths inside buildings are considered, as well as three-dimensional building parts, e.g., elevators or stairways. A hierarchical structure is also possible with the presented graph model.