Shortest path graphs for semi-directed InDoor navigation

Abstract

In this article, we explore methods for finding shortest paths for indoor navigation. We focus on the construction of the roadmap and thus, the graph representation of the public transport station's open space. Likewise, we propose a method which takes into account the possible directions of corridors. The resulting graph is generally smaller that the graph obtained using only bidirectional entry points, which helps to diminish memory consumption in big networks as well as to speed-up the calculation of the shortest path in the resulting network. Reducing the graph of connections will thus speed up the work of navigation algorithms.