Authors: YuanKo Huang
Publish Date: 2016/09/20
Volume: 99, Issue: 4, Pages: 383-404
Abstract
A new type of the spatiotemporal queries is the Intelligent Probabilistic Collision Detection Query IPCDQ for short In this paper we focus on efficiently processing the IPCDQ on moving objects with uncertainty Given two sets O and Q of objects each of which moves with uncertain speed and direction a time instant t and a probability threshold P the IPCDQ returns each pair of objects o q where o in O and q in Q whose probability of colliding with each other is greater than or equal to P at time t The pairs of objects satisfying the IPCDQ are termed the collisionpossible pairs or CPPs for short We utilize a Rlsdtree in which the spatially proximate objects with similar uncertain speeds and directions are grouped together to effectively manage the moving objects in O Similarly a Rlsdtree is used to index the moving objects in Q Then with the two Rlsdtrees for O and Q respectively we develop the specialized index traversals combined with three pruning criteria the locationpruning criterion the anglepruning criterion and the speedpruning criterion to efficiently determine the objects that may collide with each other Besides to provide the more useful information to the user we propose a probability model to quantify the possibility of each object pair being the query result Comprehensive experiments demonstrate the efficiency and the effectiveness of the proposed methods
Keywords: