TY - GEN
T1 - Path prediction of moving objects on road networks through analyzing past trajectories
AU - Kim, Sang Wook
AU - Won, Jung Im
AU - Kim, Jong Dae
AU - Shin, Miyoung
AU - Lee, Junghoon
AU - Kim, Hanil
PY - 2007
Y1 - 2007
N2 - This paper addresses a series of techniques for predicting a future path of an object moving on a road network. Most prior methods for future prediction mainly focus on the objects moving over Euclidean space. A variety of applications such as telematics, however, require us to handle the objects that move over road networks. In this paper, we propose a novel method for predicting a future path of an object in an efficient way by analyzing past trajectories whose changing pattern is similar to that of a current trajectory of a query object. For this purpose, we devise a new function for measuring a similarity between trajectories by considering the characteristics of road networks. By using this function, we search for candidate trajectories whose subtrajectories are similar to a given query trajectory by accessing past trajectories stored in moving object databases. Then, we predict a future path of a query object by analyzing the moving paths along with a current position to a destination of candidate trajectories. Also, we suggest a method that improves the accuracy of path prediction by grouping those moving paths whose differences are not significant.
AB - This paper addresses a series of techniques for predicting a future path of an object moving on a road network. Most prior methods for future prediction mainly focus on the objects moving over Euclidean space. A variety of applications such as telematics, however, require us to handle the objects that move over road networks. In this paper, we propose a novel method for predicting a future path of an object in an efficient way by analyzing past trajectories whose changing pattern is similar to that of a current trajectory of a query object. For this purpose, we devise a new function for measuring a similarity between trajectories by considering the characteristics of road networks. By using this function, we search for candidate trajectories whose subtrajectories are similar to a given query trajectory by accessing past trajectories stored in moving object databases. Then, we predict a future path of a query object by analyzing the moving paths along with a current position to a destination of candidate trajectories. Also, we suggest a method that improves the accuracy of path prediction by grouping those moving paths whose differences are not significant.
UR - http://www.scopus.com/inward/record.url?scp=38049127167&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74819-9_47
DO - 10.1007/978-3-540-74819-9_47
M3 - Conference contribution
AN - SCOPUS:38049127167
SN - 9783540748175
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 379
EP - 389
BT - Knowledge-Based Intelligent Information and Engineering Systems
PB - Springer Verlag
T2 - 11th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2007, and 17th Italian Workshop on Neural Networks, WIRN 2007
Y2 - 12 September 2007 through 14 September 2007
ER -