Time-Constrained Indoor Keyword-Aware Routing

Harry Kai Ho Chan, Tiantian Liu, Huan Li, Hua Lu

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

Abstract

With the increasingly available indoor positioning technologies, indoor location-based services (LBS) are becoming popular. Among indoor LBS applications, indoor routing is particularly in demand. In the literature, there are several existing studies on indoor keyword-Aware routing queries, each considering different criteria when finding an optimal route. However, none of these studies explicitly constraint the time budget for the route. In this paper, we propose a new problem formulation TIKRQ that considers the time needed for a user to complete the route, in addition to other criteria such as static cost and textual relevance. A set-based search algorithm and effective pruning strategies are proposed for TIKRQ. We conduct extensive experiments to verify the efficiency of our proposals.

OriginalsprogEngelsk
TitelProceedings of 17th International Symposium on Spatial and Temporal Databases, SSTD 2021
Antal sider11
ForlagAssociation for Computing Machinery
Publikationsdato23 aug. 2021
Sider74-84
ISBN (Elektronisk)9781450384254
DOI
StatusUdgivet - 23 aug. 2021
Begivenhed17th International Symposium on Spatial and Temporal Databases, SSTD 2021 - Virtual, Online, USA
Varighed: 23 aug. 202125 aug. 2021

Konference

Konference17th International Symposium on Spatial and Temporal Databases, SSTD 2021
Land/OmrådeUSA
ByVirtual, Online
Periode23/08/202125/08/2021
NavnACM International Conference Proceeding Series

Bibliografisk note

Funding Information:
This work was supported by Independent Research Fund Denmark (No. 8022-00366B).

Emneord

  • indoor query processing
  • indoor space
  • keyword-Aware
  • routing

Citer dette