Skip to main content
SpringerLink
Log in

Planning unobstructed paths in traffic-aware spatial networks

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

Route planning and recommendation have received significant attention in recent years. In this light, we study a novel problem of planning unobstructed paths in traffic-aware spatial networks (TAUP queries) to avoid potential traffic congestions. We propose two probabilistic TAUP queries: (1) a time-threshold query like “what is the path from the check-in desk to the flight SK 1217 with the minimum congestion probability to take at most 45 minutes?”, and (2) a probability-threshold query like “what is the fastest path from the check-in desk to the flight SK 1217 whose congestion probability is less than 20 %?”. These queries are mainly motivated by indoor space applications, but are also applicable in outdoor spaces. We believe that these queries are useful in some popular applications, such as planning unobstructed paths for VIP bags in airports and planning convenient routes for travelers. The TAUP queries are challenged by two difficulties: (1) how to model the traffic awareness in spatial networks practically, and (2) how to compute the TAUP queries efficiently under different query settings. To overcome these challenges, we construct a traffic-aware spatial network G t a (V, E) by analyzing uncertain trajectories of moving objects. Based on G t a (V, E), two efficient algorithms are developed to compute the TAUP queries. The performances of TAUP queries are verified by extensive experiments on real and synthetic spatial data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. http://maps.google.com/

  2. http://www.bing.com/maps/

  3. http://www.mapquest.com

  4. http://daisy.aau.dk/bagtrack

  5. http://www.bikely.com/

  6. http://www.gps-waypoints.net/

  7. http://www.sharemyroutes.com/

  8. http://research.microsoft.com/en-us/projects/geolife/

  9. For a moving object o, when it arrives at vertex p, vertex p is occupied by other objects, and the number of objects to be processed exceeds the capability of vertex p. Then, object o has to be waiting at p, and this scenario is called congestion. The computation method of congestion time-delay is introduced in Section 3.1.

References

  1. Alt H, Efrat A, Rote G, Wenk C (2003) Matching planar maps. In: SODA, pp 589–598

  2. Brakatsoulas S, Pfoser D, Salas R, Wenk C (2005) On map-matching vehicle tracking data. In: VLDB, pp 853–864

  3. Cheng R, Kalashnikov DV, Prabhakar S (2004) Querying imprecise data in moving object environments. IEEE Trans Knowl Data Eng 16(9):1112–1127

    Article  Google Scholar 

  4. Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1:269–271

    Article  Google Scholar 

  5. Ding B, Yu JX, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: EDBT, pp 205–216

  6. Greenfeld J (2002) Matching gps observations to locations on a digital map. In: 81th annual meeting of the transportation research board

  7. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Cybern 4(2):100–107

    Article  Google Scholar 

  8. Hua M, Pei J (2010) Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT, pp 347–358

  9. Jensen CS, Lu H, Yang B (2009) Graph model based indoor tracking. In: Mobile data management, pp 122–131

  10. Jensen CS, Lu H, Yang B (2009) Indexing the trajectories of moving objects in symbolic indoor space. In: SSTD, pp 208–227

  11. Liu K, Deng K, Ding Z, Li M, Zhou X (2009) Moir/mt: monitoring large-scale road network traffic in real-time. In: VLDB, pp 1538–1541

  12. Muckell J, Hwang J-H, Lawson C, Ravi S (2010) Algorithms for compressing gps trajectory data: an empirical evaluation. In: ACM GIS

  13. Pfoser D, Jensen CS (1999) Capturing the uncertainty of moving-object representations. In: SSD, pp 111–132

  14. Shang S, Ding R, Zheng K, Jensen CS, Kalnis P, Zhou X (2014) Personalized trajectory matching in spatial networks. VLDB J 23(3):449–468

    Article  Google Scholar 

  15. Shang S, Lu H, Pedersen TB, Xie X (2013) Finding traffic-aware fastest paths in spatial networks. In: SSTD, pp 128–145

  16. Shang S, Lu H, Pedersen TB, Xie X (2013) Modeling of traffic-aware travel time in spatial networks. In: MDM, p 4

  17. Shang S, Yuan B, Deng K, Xie K, Zheng K, Zhou X (2012) Pnn query processing on compressed trajectories. GeoInformatica 16(3):467–496

    Article  Google Scholar 

  18. Trajcevski G, Tamassia R, Ding H, Scheuermann P, Cruz IF (2009) Continuous probabilistic nearest-neighbor queries for uncertain trajectories. In: EDBT, pp 874–885

  19. Trajcevski G, Wolfson O, Hinrichs K, Chamberlain S (2004) Managing uncertainty in moving objects databases. ACM Trans Database Syst 29(3):463–507

    Article  Google Scholar 

  20. Wenk C, Salas R, Pfoser D (2006) Addressing the need for map-matching speed: localizing globalb curve-matching algorithms. In: SSDBM

  21. Wolfson O, Chamberlain S, Dao S, Jiang L, Mendez G (1998) Cost and imprecision in modeling the position of moving objects. In: ICDE, pp 588–596

  22. Wolfson O, Sistla AP, Chamberlain S, Yesha Y (1999) Updating and querying databases that track mobile units. Distributed and Parallel Databases 7(3):257–387

    Article  Google Scholar 

  23. Yuan J, Zheng Y, Xie X, Sun G (2011) Driving with knowledge from the physical world. In: KDD, pp 316–324

  24. Yuan J, Zheng Y, Xie X, Sun G (2013) T-drive: enhancing driving directions with taxi drivers’ intelligence. IEEE Trans Knowl Data Eng 25(1):220–232

    Article  Google Scholar 

  25. Yuan J, Zheng Y, Zhang C, Xie W, Xie X, Sun G, Huang Y (2010) T-drive: driving directions based on taxi trajectories. In: GIS, pp 99–108

  26. Zarchan P (1996) Global positioning system theory and applications. In: American institute of aeronautics and astronautics, p 1

  27. Zhang M, Chen S, Jensen CS, Ooi BC, Zhang Z (2009) Effectively indexing uncertain moving objects for predictive queries. PVLDB 2(1):1198–1209

    Google Scholar 

  28. Zheng K, Trajcevski G, Zhou X, Scheuermann P (2011) Probabilistic range queries for uncertain trajectories on road networks. In: EDBT, pp 283–294

Download references

Acknowledgments

This work is partly supported by the National Natural Science Foundation of China (NSFC. 61402532), the Science Foundation of China University of Petroleum-Beijing (No. 2462013 YJRC031), and the Excellent Talents of Beijing Program (No. 2013D009051000003).

Author information

Authors and Affiliations

  1. State Key Laboratory of Petroleum Resources and Prospecting, China University of Petroleum, Beijing, China

    Shuo Shang

  2. Department of Computer Science, China University of Petroleum, Beijing, China

    Shuo Shang

  3. CSIRO, Canberra, Australia

    Jiajun Liu

  4. School of ITEE, The University of Queensland, Brisbane, Australia

    Kai Zheng

  5. Department of Computer Science, Aalborg University, Aalborg, Denmark

    Hua Lu & Torben Bach Pedersen

  6. MOE Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University, Beijing, China

    Ji-Rong Wen

Authors
  1. Shuo Shang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiajun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kai Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hua Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Torben Bach Pedersen
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Ji-Rong Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuo Shang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shang, S., Liu, J., Zheng, K. et al. Planning unobstructed paths in traffic-aware spatial networks. Geoinformatica 19, 723–746 (2015). https://doi.org/10.1007/s10707-015-0227-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-015-0227-9

Keywords

Search

Navigation