Intelligent transport navigation system using LookAhead Continuous KNN
Geng Zhao, Kefeng Xuan, David Taniar, Wenny J. Rahayu · 2009
One of the most popular queries in vehicle navigation, continuous k nearest neighbor, has been widely addressed. However, none of them focuses on continuous lookahead k nearest neighbor. Hence, in this paper, we propose a new approach, called continuous lookahead K nearest neighbor (CLKNN). CLKNN query is different from the traditional continuous k nearest neighbor, whereby in our CLKNN, mobile users concerns with only the interest points in the forward space of query point according to a predefined moving direction. Interest points, which are behind the moving query point, are not of interest anymore. We propose algorithms for lookahead KNN as well as continuous lookahead KNN. The former is used for static query point, whereas the latter is used for moving query point. Our experiments verify the applicability of the proposed approach to solve queries which involve lookahead k nearest neighbors continuously.