earticle

영어

K-aggregate nearest neighbor query method of mobile objects in road networks is studied. Moving state model of object is introduced, and road network distance calculation formula is provided. Besides, this paper designs a kANN query algorithm that can find out the previous k target nodes with the smallest aggregate function value among multiple target nodes for various query points when query points and data points are under moving state in road networks. The candidate results are cut short via pruning method. Finally, performance of the algorithm is verified through simulation experiment, and results of the simulation experiment prove that this algorithm has high efficiency and accuracy.