期刊文献+

基于位置服务的轨迹预测方法 被引量:1

Trajectory Prediction Method for Location-based Service
下载PDF
导出
摘要 现有移动对象在路网中位置预测的技术大部分是当前路段上短期预测.为了能够长期准确预测路径,提出一个路网分层模型,通过路网分层和减少路网中的路口节点来降低路网的复杂度,提高了轨迹预测算法的性能,同时也减少了数据库中的存储数据量,避免了不必要的通信开销.然后,基于路网模型提出了一个探测回溯算法.该算法按路网分层模型综合考虑路段信息选择概率最高的路段,提高了算法的精确度和效率.通过真实数据表明,这种方法比现有的预测方法更准确和高效. Most of the existing location prediction techniques for moving objects on road network are mainly short-term prediction on the current road fragment. In order to accurately predict the long-term trajectory, this paper presents a hierarchical road network model, to lower the complexity by reducing intersection nodes on road networks. It improves the performance by reducing the amount of data storage and avoiding the unnecessary communication overhead. Based on the model, the paper proposes a detection backtracking algorithm,which comprehensively chooses the highest probability road fragment according to the hierarchical road network information. The experiments on real data show that this method is more accurate and efficient than other prediction algorithms.
出处 《小型微型计算机系统》 CSCD 北大核心 2016年第6期1191-1196,共6页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61003031)资助 上海重点科技攻关项目(14511107902)资助 上海市工程中心建设项目(GCZX14014)资助 上海市一流学科建设项目(XTKX2012)资助 沪江基金研究基地专项项目(C14001)资助
关键词 轨迹预测 基于位置服务 路网分层 长期预测 trajectory prediction location-based services road network model long-term prediction
  • 相关文献

参考文献18

  • 1Song C, Qu Z, Blumm N, et al. Limits of predictability in human mobility[ J]. Science,2010,327 (5968) : 1018-1021.
  • 2Jensen C S, Lin D, Ooi B C. Query and update efficient B + -tree based indexing of moving objects[ C]. Proceedings of the Thirtieth International Conference on Very Large Data Bases-Volume 30, VLDB Endowment,2004:768-779.
  • 3Jensen C S, Lin D, Ooi B C, et al. Effective density queries on con- tinuously moving objects[ C ]. Data Engineering ICDE'06, Proceed- ings of the 22nd International Conference on,IEEE,2006:71-71.
  • 4Heravi E J, Khanmohammadi S. Long term trajectory prediction of moving objects using gaussian process[ C ]. Robot, Vision and Sig- nal Processing ( RVSP ), 2011 First International Conference on, IEEE ,2011:228-232.
  • 5Ellis D, Sommerlade E, Reid I. Modelling pedestrian trajectory pat- terns with gaussian processes [ C ]. Computer Vision Workshops (ICCV Workshops) ,2009 IEEE 12th International Conference on, IEEE ,2009 : 1229-1234.
  • 6Tao Y, Faloutsos C, Papadias D, et al. Prediction and indexing of moving objects with unknown motion patterns [ C ]. Proceedings of the 2004 ACM SIGMOD International Conference on Management of data, ACM,2004 : 611-622.
  • 7Jensen C S, Pakalnis S. Trax:real-world tracking of moving objects [ C ]. Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB Endowment,2007 : 1362-1365.
  • 8Chen J, Meng X. Trajectory prediction of moving objects [ M ]. Moving Objects Management, Springer Berlin Heidelberg, 2010: 105-112.
  • 9Karimi H A, Liu X. A predictive location model for location-based services [ C ]. Proceedings of the 11 th ACM International Symposi- um on Advances in Geographic Information Systems, ACM, 2003 : 126-133.
  • 10Kim S W, Won J I, Kim J D, et al. Path prediction of moving ob- jects on road networks through analyzing past trajectories [ C ].Knowledge-based Intelligent Information and Engineering Systems, Springer Berlin Heidelberg,2007 : 379 -389.

二级参考文献29

  • 1刘经南.泛在测绘与泛在定位的概念与发展[J].数字通信世界,2011(S1):28-30. 被引量:31
  • 2Renz M, Cheng R, Kriegel H P, et al. Similarity search and mining in uncertain databases [J]. Proceedings of the VLDB Endowment, 2010, 3(2): 1653-1654.
  • 3Cheng R, Kalashnikov D, Prabhakar S. Evaluating probabilistic queries over imprecise data [C]//Proc of the 2003 ACM SIGMOD Int Conf on Management of data. New York: ACM, 2003:551-562.
  • 4Re C, Dalvi N, Suciu D. Efficient top-k query evaluation on probabilistic data[C]//Proc of the 23rd Int Conf on Data Engineering (ICDE). Piscataway, NJ: IEEE, 2007: 886- 895.
  • 5Hua Ming, Pei Jian, Zhang Wenjie, et al. Ranking queries on uncertain data: A probabilistic threshold approach [C]// Proc of 2008 ACM SIGMOD Int Conf on Management of data. New York: ACM, 2008: 673-686.
  • 6Sarma A D, Benjelloun O, Halevy A, et al. Representing uncertain data: Models, properties, and algorithms [J]. The VLDB Journal, 18(5) : 989-1019.
  • 7Ngai W K, Kao B, Chui C K, et al. Efficient clustering of uncertain data [C]//Proc of the 6th IEEE Int Conf on Data Mining (ICDM 2006). Piscataway, NJ: IEEE, 2006: 436- 445.
  • 8Sathe S, Jeung H, Aberer K. Creating probabilistic databases from imprecise time-series data[C] //Proc of the 27th Int Conf on Data Engineering ( ICDE 2011 ). Piscataway, NJ: IEEE, 2011:327-338.
  • 9Bernecker T, Emrich T, Kriegel H, et al. A novel probabilistic pruning approach to speed up similarity queries in uncertain databases[C] //Proc of the 27th Int Conf on Data Engineering (ICDE 2011). Piscataway, NJ: IEEE, 2011:339-350.
  • 10Agrawal R, Faloutsos C, Swami A. Efficient similarity search in sequence databases [C]//Proc of the 4th Int Conf on Foundations of Data Organization and Algorithms (FODO 1993). Heidelberg: Springer, 1993: 69-84.

共引文献62

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部