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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
