动态权重路网下的连续近邻查询  

Continuous Nearest Neighbor Queries in Dynamic Weight Road Networks

作　　者：吕卫锋[1] 王飞[1] 姜新新[1] 诸彤宇[1] 

机构地区：[1]北京航空航天大学软件开发环境国家重点实验室,北京100191

出　　处：《计算机工程》2011年第19期157-159,共3页Computer Engineering

基　　金：国家"973"计划基金资助项目(2005CB321903)

摘　　要：现有的近邻查询在查询相同或相近目标时,会得到相同的行驶路线,从而导致大量用户聚集到该区域,造成二次拥堵。针对上述问题,提出一种支配关系监控算法。该算法采用实时交通信息作为动态权重,并给出一个在路网权重变化下的连续k近邻查询方法,有效地避免二次拥堵。实验结果验证了该算法的有效性和高效性。When continuous nearest neighbors query the targets which are close,they always find the same routes to the nearest neighbors all the time,which makes more and more users follow the same way,and causes a traffic jam.Aiming at the problem,this paper proposes a domination relationship monitoring algorithm.It uses real-time traffic information as the change weight,gives a novel form of continuous k nearest neighbor queries considering the large scale weight changes in road networks to avoid traffic jams.Experimental result shows the efficiency and effectiveness of the algorithm.

关 键 词：连续近邻查询 动态权重 支配关系 实时交通信息 路网 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]