一种高效的多准则室内路径规划近似算法
An Efficient Approximation Algorithm for Multi-criteria Indoor Route Planning Queries
摘要:
路线规划查询具有许多现实应用,并且在诸如道路网络或欧几里得空间的室外空间中已经被广泛研究。尽管其在室内场所(例如,购物中心,图书馆,机场),几乎所有现有的研究是专门为室外空间设计的,并没有考虑到室内空间,如走廊,楼梯,自动扶梯,房间等的独特属性。我们确定了这一研究差距,并正式定义了类别感知的多标准路线规划查询问题,表示为CAM,其返回从室内源点到室内目标点的最优路线,该最优路线经过来自每个给定类别的至少一个室内点,同时最小化路线在行进距离和其它相关属性方面的总成本。我们证明了CAM查询是NP难的。基于一种新的基于优势的修剪,我们提出了一种高效的算法,产生高质量的结果。我们提供了在澳大利亚最大的购物中心进行了广泛的实验研究,并比较我们的算法与其他方法。实验表明,我们的算法是高效的,并产生高质量的结果。
英文摘要:
A route planning query has many real-world applications and has been studied extensively in outdoor spaces such as road networks or Euclidean space. Despite its many applications in indoor venues (e.g., shopping centres, libraries, airports), almost all existing studies are specifically designed for outdoor spaces and do not take into account unique properties of the indoor spaces such as hallways, stairs, escalators, rooms etc. We identify this research gap and formally define the problem of category aware multi-criteria route planning query, denoted by CAM, which returns the optimal route from an indoor source point to an indoor target point that passes through at least one indoor point from each given category while minimizing the total cost of the route in terms of travel distance and other relevant attributes. We show that CAM query is NP-hard. Based on a novel dominance-based pruning, we propose an efficient algorithm which generates high-quality results. We provide an extensive experimental study conducted on the largest shopping centre in Australia and compare our algorithm with alternative approaches. The experiments demonstrate that our algorithm is highly efficient and produces quality results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。