Efficient real-time trajectory tracking

被引:0
作者
Ralph Lange
Frank Dürr
Kurt Rothermel
机构
[1] Universität Stuttgart,Institute of Parallel and Distributed Systems (IPVS)
来源
The VLDB Journal | 2011年 / 20卷
关键词
Moving objects database; MOD; Trajectory tracking; Dead reckoning; Line simplification;
D O I
暂无
中图分类号
学科分类号
摘要
Moving objects databases (MOD) manage trajectory information of vehicles, animals, and other mobile objects. A crucial problem is how to efficiently track an object’s trajectory in real-time, in particular if the trajectory data is sensed at the mobile object and thus has to be communicated over a wireless network. We propose a family of tracking protocols that allow trading the communication cost and the amount of trajectory data stored at a MOD off against the spatial accuracy. With each of these protocols, the MOD manages a simplified trajectory that does not deviate by more than a certain accuracy bound from the actual movement. Moreover, the different protocols enable several trade-offs between computational costs, communication cost, and the reduction in the trajectory data: Connection-Preserving Dead Reckoning minimizes the communication cost using dead reckoning, a technique originally designed for tracking an object’s current position. Generic Remote Trajectory Simplification (GRTS) further separates between tracking of the current position and simplification of the past trajectory and can be realized with different line simplification algorithms. For both protocols, we discuss how to bound the space consumption and computing time at the moving object and thereby present an effective compression technique to optimize the reduction performance of real-time line simplification in general. Our evaluations with hundreds of real GPS traces show that a realization of GRTS with a simple simplification heuristic reaches 85–90% of the best possible reduction rate, given by retrospective offline simplification. A realization with the optimal line simplification algorithm by Imai and Iri even reaches more than 97% of the best possible reduction rate.
引用
收藏
页码:671 / 694
页数:23
相关论文
共 28 条
  • [1] Agarwal P.K.(2005)Near-linear time approximation algorithms for curve simplification Algorithmica 42 203-219
  • [2] Har-Peled S.(2000)Efficient algorithms for approximating polygonal chains Discret. Comput. Geom. 23 273-291
  • [3] Mustafa N.H.(2006)Spatio-temporal data reduction with deterministic error bounds VLDB J. 15 211-228
  • [4] Wang Y.(1973)Algorithms for the reduction of the number of points required to represent a digitized line or its caricature Can. Cartog. 10 112-122
  • [5] Agarwal P.K.(2003)Algorithms for moving objects databases Comput. J. 46 680-712
  • [6] Varadarajan K.R.(2001)A comparison of protocols for updating location information Clust. Comput. J. Netw. Softw. Tools Appl. 4 355-367
  • [7] Cao H.(2003)Spatio-temporal access methods IEEE Data Eng. Bull. 26 40-49
  • [8] Wolfson O.(2005)Techniques for efficient road-network-based tracking of moving objects IEEE Trans. Knowl. Data Eng. (TKDE) 17 698-712
  • [9] Trajcevski G.(1999)Updating and querying databases that track mobile units Distrib. Parallel Databases 7 257-287
  • [10] Douglas D.H.(undefined)undefined undefined undefined undefined-undefined