Shortest Path Queries for Indoor Venues with Temporal Variations

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

doi:10.1109/ICDE48307.2020.00227

Shortest Path Queries for Indoor Venues with Temporal Variations

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

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

14 Citations (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.

Original language	English
Title of host publication	The 36th IEEE International Conference on Data Engineering (ICDE 2020)
Number of pages	4
Publisher	IEEE
Publication date	Apr 2020
Pages	2014-2017
Article number	9101764
ISBN (Print)	978-1-7281-2904-4
ISBN (Electronic)	9781728129037
DOIs	https://doi.org/10.1109/ICDE48307.2020.00227
Publication status	Published - Apr 2020
Event	36th IEEE International Conference on Data Engineering - Dallas, United States Duration: 20 Apr 2020 → 24 Apr 2020 https://www.utdallas.edu/icde/

Conference

Conference	36th IEEE International Conference on Data Engineering
Country/Territory	United States
City	Dallas
Period	20/04/2020 → 24/04/2020
Internet address	https://www.utdallas.edu/icde/

Series	Proceedings of the International Conference on Data Engineering
ISSN	1063-6382

Keywords

Indoor routing
Temporal-variation
Shortest path algorithm

Access to Document

10.1109/ICDE48307.2020.00227

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@inproceedings{61ebc02005534f4fae0278da6e3044bc,

title = "Shortest Path Queries for Indoor Venues with Temporal Variations",

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.",

keywords = "Indoor routing, Temporal-variation, Shortest path algorithm",

author = "Tiantian Liu and Zijin Feng and Huan Li and Hua Lu and Cheema, {Muhammad Aamir} and Hong Cheng and Jianliang Xu",

year = "2020",

month = apr,

doi = "10.1109/ICDE48307.2020.00227",

language = "English",

isbn = "978-1-7281-2904-4",

series = "Proceedings of the International Conference on Data Engineering",

publisher = "IEEE",

pages = "2014--2017",

booktitle = "The 36th IEEE International Conference on Data Engineering (ICDE 2020)",

address = "United States",

note = "36th IEEE International Conference on Data Engineering, ICDE 2020 ; Conference date: 20-04-2020 Through 24-04-2020",

url = "https://www.utdallas.edu/icde/",

}

Liu, T, Feng, Z, Li, H, Lu, H, Cheema, MA, Cheng, H & Xu, J 2020, Shortest Path Queries for Indoor Venues with Temporal Variations. in The 36th IEEE International Conference on Data Engineering (ICDE 2020)., 9101764, IEEE, Proceedings of the International Conference on Data Engineering, pp. 2014-2017, 36th IEEE International Conference on Data Engineering, Dallas, Texas, United States, 20/04/2020. https://doi.org/10.1109/ICDE48307.2020.00227

Shortest Path Queries for Indoor Venues with Temporal Variations. / Liu, Tiantian; Feng, Zijin; Li, Huan et al.
The 36th IEEE International Conference on Data Engineering (ICDE 2020). IEEE, 2020. p. 2014-2017 9101764 (Proceedings of the International Conference on Data Engineering).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - Shortest Path Queries for Indoor Venues with Temporal Variations

AU - Liu, Tiantian

AU - Feng, Zijin

AU - Li, Huan

AU - Lu, Hua

AU - Cheema, Muhammad Aamir

AU - Cheng, Hong

AU - Xu, Jianliang

PY - 2020/4

Y1 - 2020/4

N2 - 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.

AB - 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.

KW - Indoor routing

KW - Temporal-variation

KW - Shortest path algorithm

UR - http://www.scopus.com/inward/record.url?scp=85085863697&partnerID=8YFLogxK

U2 - 10.1109/ICDE48307.2020.00227

DO - 10.1109/ICDE48307.2020.00227

M3 - Article in proceeding

SN - 978-1-7281-2904-4

T3 - Proceedings of the International Conference on Data Engineering

SP - 2014

EP - 2017

BT - The 36th IEEE International Conference on Data Engineering (ICDE 2020)

PB - IEEE

T2 - 36th IEEE International Conference on Data Engineering

Y2 - 20 April 2020 through 24 April 2020

ER -

Shortest Path Queries for Indoor Venues with Temporal Variations

Abstract

Conference

Keywords

Access to Document

AUB Link

Other files and links

Fingerprint

Cite this