Email this article 
Open Access
Subscription or Fee Access
Efficient Driving Direction Technique Based on Trajectories
Abstract
In Efficient driving direction system, the GPS-equipped vehicle are used as mobile sensors thereby probing the traffic rhythm of a city. It helps the drivers in choosing driving directions. The smart driving directions can mine from the historical GPS trajectories. A time-dependent landmark graph is framed with the view of modeling the dynamic traffic pattern and also the intelligence of experienced drivers. Hence it helps assist the user by providing the practically fastest route to a given destination at a given time of departure. The Variance Entropy-Based Clustering method is employed to estimate the distribution of travel time between two landmarks in different time slots. Taking this graph as a basis, a two-stage routing algorithm is used to compute the practically fastest and customized route for end users. Necessarily, the time taken by a driver to traverse a route depends on the following aspects: 1) The physical feature of a route such as distance, capacity (lanes), and the number of traffic lights, number of direction turns; 2) The time-dependent traffic flow along the route; 3) The driving behavior of a user.
Keywords
References
R. Chhikara and L. Folks. The inverse Gaussian distribution: theory, methodology, and applications. 1989.
K. Cooke and E. Halsey. The shortest route through a network with time-dependent internodal transit times. J.Math. Anal. Appl,14(492-498):78.
B. C. Dean. Continuous-time dynamic shortest path algorithms. Master's thesis, Massachusetts Institute of Technology, 1999.
B. Ding, J. Yu, and L. Qin. Finding time-dependent shortest paths over large graphs. In Proc. EDBT, pages 205-216. ACM, 2008.
S.Dreyfus.An appraisal of some shortest-path algorithms. Operations Research, 17(3).
Fayyad and Irani. Multi-interval discretization of continuous-valued attributes for classification learning.Proc. IJCAI, pages 1022-1027, 1993.
Gonzalez, H., Han, J., Li, X., Myslinska, M., and Sondag, J. P. 2007. Adaptive fastest path computation on a road network: a traffic mining approach. In Proceedings of the 33rd international Conference on Very Large Data Bases 794-805, 2007.
Y. Zheng, Q. Li, Y. Chen, X. Xie, and W. Ma. Understanding mobility based on GPS data. In Proc. Ubicomp, pages 312
E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on a road network with speed patterns. In Proc.ICDE, 2006.
Y. Zheng, L. Liu, L. Wang, and X. Xie. Learning transportation mode from raw gps data for geographic applications on the web. In Proc. WWW, pages 247-256,2008
Y. Lou, C. Zhang, Y. Zheng, X. Xie, W. Wang, and Y. Huang. Map-matching for low-sampling-rate GPS trajectories. In Proc. GIS. ACM, 2009.
A. Orda and R. Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length.JACM, 37(3):625, 1990.
D. Pfoser, S. Brakatsoulas, P. Brosch, M. Umlauft,N. Tryfona, and G. Tsironis. Dynamic travel time provision for road networks. In Proc. GIS. ACM, 2008.
J. Yuan, Y. Zheng, C. Zhang, and X. Xie. An interactive-voting based map matching algorithm. In ProcMDM, 2010.
KUEHNE, R. et al. new approaches for traffic management in metropolitan areas. in 10th ifac symposium on control in transportation systems, 2003
LI, X., HAN, J., LEE, J., AND GONZALEZ, H. traffic density-based discovery of hot routes in road networks. in 10th international symposium on spatial and temporal databases, 2007
PFOSER, D. AND JENSEN, C. S. Capturing the uncertainty of moving-object representations. In proceedings of the 6th international symposium on advances in spatial databases, 111-132, 1999.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.