路网中速度不确定移动对象的k近邻查询  

k-nearest Neighbor Query for Moving Objects with Uncertain Velocity in Road Network

作　　者：王宝文[1] 胡云[1] 陈子军[1] 刘文远[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《小型微型计算机系统》2012年第8期1756-1760,共5页Journal of Chinese Computer Systems

摘　　要：目前在基于道路网的移动对象的各类查询研究中,大多都是在假定移动对象速度固定不变的基础上进行的.而实际上因为外界环境和自身情况等不确定性因素的影响,对象的速度可能会发生变化.基于此,本文提出一种基于路网的速度不确定的移动对象的k近邻查询处理方法.在查询时刻根据查询点位置执行查询操作,得到构成查询点k近邻的候选对象集合,再根据概率计算方法得到结果集及其概率.实验结果表明本文所提方法是有效的.The velocities of moving objects are assumed to be flxed in most researches of different types of queries on road network.In fact,influenced by the uncertainty factors（e.g.external environment like road condition,individual situation and so forth）,the velocities of moving objects may be varied.In this paper,we improsed a method for k nearest neighbors query of moving objects with uncertain velocity in road network.At the query time point,according to the position of query object,the query processing get candiate objects that have chance to be a query answer.Then compute the k nearest neighbors′subset of candiate objects and its probability according to the probability computing method.Experimental results show that the proposed method has good efficiency and effectiveness.

关 键 词：不确定性 移动对象 路网 K近邻查询 概率 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]