An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments
AbstractRouting systems for outdoor space have become the focus of many research works. Such routing systems are based on spatial road networks where moving objects (such as cars) are affected by the directed roads and the movement of traffic, which may include traffic jams. Indoor routing, on the other hand, must take into account the features of indoor space such as walls and rooms. In this paper, we take indoor routing in a new direction whereby we consider the features that a building has in common with outdoor spaces. Inside some buildings, there may be directed floors where moving objects must move in a certain direction through directed corridors in order to reach a certain location. For example, on train platforms or in museums, movement in the corridors may be directed. In these directed floor spaces, a routing system enabling a visitor to take the shortest path to a certain location is essential. Therefore, this work proposes a new approach for buildings with directed indoor spaces, where each room can be affected by the density of the moving objects. The proposed system obtains the shortest path between objects or rooms taking into consideration the directed indoor space and the capacity of the objects to move within each room/cell. View Full-Text
Share & Cite This Article
Alamri, S. An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments. ISPRS Int. J. Geo-Inf. 2018, 7, 133.
Alamri S. An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments. ISPRS International Journal of Geo-Information. 2018; 7(4):133.Chicago/Turabian Style
Alamri, Sultan. 2018. "An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments." ISPRS Int. J. Geo-Inf. 7, no. 4: 133.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.