Shortest Path Queries for Indoor Venues with Temporal Variations

Tiantian Liu, Zijin Feng, Huan Li, Hua Lu, Muhammad Aamir Cheema, Hong Cheng, Jianliang Xu

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

13 Citationer (Scopus)
54 Downloads (Pure)

Abstract

Indoor shortest path query (ISPQ) is of fundamental importance for indoor location-based services (LBS). However, existing ISPQs ignore indoor temporal variations, e.g., the open and close times associated with entities like doors and rooms. In this paper, we define a new type of query called Indoor Temporal-variation aware Shortest Path Query (ITSPQ). It returns the valid shortest path based on the up-to-date indoor topology at the query time. A set of techniques is designed to answer ITSPQ efficiently. We design a graph structure (IT-Graph) that captures indoor temporal variations. To process ITSPQ using IT-Graph, we design two algorithms that check a door's accessibility synchronously and asynchronously, respectively. We experimentally evaluate the proposed techniques using synthetic data. The results show that our methods are efficient.

OriginalsprogEngelsk
TitelThe 36th IEEE International Conference on Data Engineering (ICDE 2020)
Antal sider4
ForlagIEEE
Publikationsdatoapr. 2020
Sider2014-2017
Artikelnummer9101764
ISBN (Trykt)978-1-7281-2904-4
ISBN (Elektronisk)9781728129037
DOI
StatusUdgivet - apr. 2020
Begivenhed36th IEEE International Conference on Data Engineering - Dallas, USA
Varighed: 20 apr. 202024 apr. 2020
https://www.utdallas.edu/icde/

Konference

Konference36th IEEE International Conference on Data Engineering
Land/OmrådeUSA
ByDallas
Periode20/04/202024/04/2020
Internetadresse
NavnProceedings of the International Conference on Data Engineering
ISSN1063-6382

Fingeraftryk

Dyk ned i forskningsemnerne om 'Shortest Path Queries for Indoor Venues with Temporal Variations'. Sammen danner de et unikt fingeraftryk.

Citationsformater