基于动态剪枝P-region的时空限制路径查询方法

Spatio-temporal Constrained Path Query Method Based on Dynamic Pruning P-region

为提供实时、精准的路径查询服务,实现移动目标的路径规划,以路网和移动目标为研究对象,以时间和空间为查询条件,提出一种基于动态剪枝P-region的时空限制路径查询方法。将空间索引的查询剪枝问题转化为非欧氏空间距离的快速查询问题,并围绕数据预处理、索引设计、路网绘制和路径查询进行详细分析。实验结果表明,动态剪枝算法能够在保证查询精度的前提下显著提升查询效率。

In order to provide real-time and accurate path query service and realize the path planning of moving objects,a spatio-temporal constrained path query method based on dynamic pruning P-region is proposed,which takes road network and moving objects as research objects and takes time and space as query conditions.The query pruning problem of spatial index is transformed into a fast query problem of non-Euclidean spatial distance,and the data preprocessing,index design,road network drawing and path query are analyzed in detail.The experimental results show that the dynamic pruning algorithm can significantly improve the query efficiency on the premise of guaranteeing query accuracy.