Inter-building Routing Approach for Indoor Environment

Dionti, Tiara Annisa; Adhinugraha, Kiki Maulana; Alamri, Sultan

doi:10.1007/978-3-319-62392-4_18

Cited by 7 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, the Beijing subway is a rapid transit rail networks with 227 stations and passengers numbering in excess of 7 million daily. Consequently, the positioning and monitoring of mobile objects indoors on different floors have become an essential research field with many applications for the location of mobile objects, indoor multifloor wayfinding, and security [10][11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

Vertical Indexing for Moving Objects in Multifloor Environments

Alamri

Taniar

Nguyen

2018

Mobile Information Systems

View full text Add to dashboard Cite

e indexing and tracking of objects moving in indoor spaces has increasingly become an important area of research, which presents a fundamentally different challenge. ere are two main reasons for why indoor should be treated as cellular space. Firstly, an indoor space has entities, such as rooms and walls, that constrain the movement of the moving objects. Secondly, the relevant notion of locations of an object is cell based rather than an exact Euclidean coordinate. As a solution, in our earlier works, we proposed a cell-based indexing structure, called the C-tree, for indexing objects moving in indoor space. In this paper, we extend the C-tree to solve another interesting problem. It can be observed that many indoor spaces (such as shopping centers) contain wings/sections. For such a space, there are queries for which the wing/section location of an object, rather than the cellular location, is the relevant answer (e.g., "the object is in the east wing"). In this paper, we propose a new index structure, called the GMI-tree ("GMI" stands for "Graph-based Multidimensional Index"). e GMI-tree is based on two notions of distance, or equivalently, two notions of adjacency: one represents horizontal adjacency and the other represents vertical adjacency.

show abstract

Section: Introductionmentioning

confidence: 99%

Vertical Indexing for Moving Objects in Multifloor Environments

Alamri

Taniar

Nguyen

2018

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…As is clear, most of the previous research has focused on regular indoor spaces where movement is not restricted or directed [23][24][25]. Moreover, most of the current indoor space data structures and querying do not consider the density of objects moving in indoor space, which actually has an important impact on movement indoors [26][27][28].…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, the aim of [23] was to test different algorithms such as the Floyd-Warshall algorithm, the Bellman-Ford algorithm, the A* algorithm and Dijkstra's algorithm in order to find the shortest path in the buildings of Telkom University. Note that in [23], the algorithm used a metric distance, which is not applied in our proposed system.…”

Section: Related Workmentioning

confidence: 99%

“…In order to determine the shortest route between two points, a shortest path algorithm can be implemented that is based on the three-dimensional space structure. The work of [23] implemented an indoor routing system using the method in three-dimensional spaces in order to determine the shortest route in general and the closest shortest route, which is the shortest route that will not pass through the open space (to avoid some environmental conditions such as rain or sun). In [23], the indoor space is undirected, meaning that there is free movement, unlike the directed indoor space considered in this work.…”

Section: Related Workmentioning

confidence: 99%

“…The work of [23] implemented an indoor routing system using the method in three-dimensional spaces in order to determine the shortest route in general and the closest shortest route, which is the shortest route that will not pass through the open space (to avoid some environmental conditions such as rain or sun). In [23], the indoor space is undirected, meaning that there is free movement, unlike the directed indoor space considered in this work. Moreover, the aim of [23] was to test different algorithms such as the Floyd-Warshall algorithm, the Bellman-Ford algorithm, the A* algorithm and Dijkstra's algorithm in order to find the shortest path in the buildings of Telkom University.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments

Alamri

2018

IJGI

View full text Add to dashboard Cite

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.

show abstract