A gravity model for speed estimation over road network

Proceedings - IEEE International Conference on Mobile Data Management

Volumn 2, Issue , 2013, Pages 136-141

  Cintia, Paolo ^a   Trasarti, Roberto ^b   Macedo, Jose Antonio De ^c   Almada, Livia ^c   Fereira, Camila ^c  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

^c Federal University of Ceara   (Portugal)

Author keywords

data mining; map matching; time dependent network

Indexed keywords

ERROR DISTRIBUTIONS; GRAVITATIONAL MODEL; MAP MATCHING; SPEED ESTIMATION; TIME-DEPENDENT NETWORKS; TRACKING DEVICES; TRAFFIC CONDITIONS; TRAFFIC INFORMATION;

DATA MINING; INFORMATION MANAGEMENT; TRAFFIC CONTROL;

MOTOR TRANSPORTATION;

EID: 84883491352     PISSN: 15516245     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MDM.2013.83     Document Type: Conference Paper

References (14)

1. Chen D.,Driemel A.,Guibas L.,Nguyen A,Wenk C. Approximate Map Matching with respect to the Frchet Distance. SIAM 2011
2. Lou Y., Zhang C., Zheng Y.,Xie X., Wang W., Huang Y. Map-Matching for Low-Sampling-Rate GPS Trajectories. ACM-GIS 2009
3. J. Yuan, Y. Zheng, C. Zhang, X. Xie, and G. Sun An Interactive Votingbased Map Matching Algorithms. MDM 2010
4. Zheng K.,Zheng Y.,Xie X.,Zhou X. Reducing uncertainty of Low-Sampling-Rate trajectories. ICDE 2012
5. Newson P., Krumm J. Hidden Markov Map Matching trough noise and sparseness. ACM GIS 2009
6. M. Behrisch and L. Bieker and J. Erdmann and D. Krajzewicz SUMO-Simulation of Urban MObility: An Overview SIMUL 2011, The Third International Conference on Advances in System Simulation, 2011
7. F. Giannotti, M. Nanni, D. Pedreschi, F. Pinelli, C. Renso, S. Rinzivillo, R. Trasarti Unveiling the complexity of human mobility by querying and mining massive trajectory data The VLDB Journal, vol. 20, no. 5, pp. 695-719, 2011.
8. Nannicini, G., Delling, D., LeoLiberti, and Schultes, D. Bidirectional A search for time-dependent fast paths Proceedings of the 7th International Conference on Experimental Algorithms, pp.334-346, 2008.
9. Cooke, K. L. and Halsey, E. The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications, vol. 14, no. 3, pp. 493-498, 1966.
10. Delling, D. Time-Dependent Sharc-Routing. Algorithmica, 2011.
11. Bauer, R., Delling, D. Sharc: fast and robust unidirectional routing. ALENEX 2008
12. Demiryurek, U., Kashani, F. B., and Shahabi, C. Towards k-nearest neighbor search in time-dependent spatial network databases. Databases in Networked Information Systems, pp. 296-310, 2010.
13. Cruz, L. A., Nascimento, M. A. and Mac?do, J. A. F. K-nearest neighbors queries in time-dependent road networks Journal of Information and Data Management, vol. 3, pp. 211-226, 2012.
14. Orda, A. and Rom, R. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM, vol. 37, no. 3, pp. 607-625, 1990. (Pubitemid 20723071)