Next Article in Journal
Mapping Heritage: Geospatial Online Databases of Historic Roads. The Case of the N-340 Roadway Corridor on the Spanish Mediterranean
Next Article in Special Issue
Assessing the Influence of Spatio-Temporal Context for Next Place Prediction using Different Machine Learning Approaches
Previous Article in Journal
Enhancing Location-Related Hydrogeological Knowledge
Previous Article in Special Issue
Deriving Animal Movement Behaviors Using Movement Parameters Extracted from Location Data
Article Menu
Issue 4 (April) cover image

Export Article

Open AccessArticle
ISPRS Int. J. Geo-Inf. 2018, 7(4), 133; https://doi.org/10.3390/ijgi7040133

An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments

College of Computing and Informatics, Saudi Electronic University, Riyadh 32256, Saudi Arabia
Received: 24 January 2018 / Revised: 19 March 2018 / Accepted: 22 March 2018 / Published: 26 March 2018

Abstract

Routing 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
Keywords: spatial databases; directed indoor space; routing algorithm spatial databases; directed indoor space; routing algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Alamri, S. An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments. ISPRS Int. J. Geo-Inf. 2018, 7, 133.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
ISPRS Int. J. Geo-Inf. EISSN 2220-9964 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top