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 as the foundations of processing TIKRQ. To further enhance the practicability of TIKRQ, we study the extensions of TIKRQ and propose efficient solutions. First, we present two TIKRQ variants, namely preferred visiting order and absence of a target point. Second, we present a session-based TIKRQ that keeps track of and refines a user’s routing results when the user changes the query parameters. We conduct extensive experiments on both real and synthetic datasets to verify the efficiency of our proposals.

随着室内定位技术的日益普及，基于室内位置的服务（LBS）越来越受欢迎。在室内 LBS 应用中，尤其需要室内路由。在文献中，有几项关于室内关键字感知路由查询的现有研究，每项研究在寻找最佳路线时都考虑了不同的标准。然而，这些研究都没有明确限制路线的时间预算。在本文中，我们提出了一个新的问题公式 TIKRQ，除了静态成本和文本相关性等其他标准外，它还考虑了用户完成路线所需的时间。提出了一种基于集合的搜索算法和有效的剪枝策略作为处理 TIKRQ 的基础。为进一步提升TIKRQ的实用性，我们研究了 TIKRQ 的扩展并提出了有效的解决方案。首先，我们提出了两个 TIKRQ 变体，即首选访问顺序和没有目标点。其次，我们提出了一个基于会话的 TIKRQ，它可以在用户更改查询参数时跟踪并优化用户的路由结果。我们对真实和合成数据集进行了大量实验，以验证我们提议的效率。