Dynamic Shortest Path Monitoring in Spatial Networks
- 147 Downloads
With the increasing availability of real-time traffic information, dynamic spatial networks are pervasive nowadays and path planning in dynamic spatial networks becomes an important issue. In this light, we propose and investigate a novel problem of dynamically monitoring shortest paths in spatial networks (DSPM query). When a traveler aims to a destination, his/her shortest path to the destination may change due to two reasons: 1) the travel costs of some edges have been updated and 2) the traveler deviates from the pre-planned path. Our target is to accelerate the shortest path computing in dynamic spatial networks, and we believe that this study may be useful in many mobile applications, such as route planning and recommendation, car navigation and tracking, and location-based services in general. This problem is challenging due to two reasons: 1) how to maintain and reuse the existing computation results to accelerate the following computations, and 2) how to prune the search space effectively. To overcome these challenges, filter-and-refinement paradigm is adopted. We maintain an expansion tree and define a pair of upper and lower bounds to prune the search space. A series of optimization techniques are developed to accelerate the shortest path computing. The performance of the developed methods is studied in extensive experiments based on real spatial data.
Keywordsshortest path dynamic spatial network spatial database location-based service
Unable to display preview. Download preview PDF.
- Parkinson B, Spiker Jr J, Axelrad P, Enge P. Global positioning system: Theory and applications. In Progress in Astronautics and Aeronautics 163, Zarchan P(ed.), American Institute of Aeronautics and Astronautics, Inc., 1996.Google Scholar
- Ding B, Yu J X, Qin L. Finding time-dependent shortest paths over large graphs. In Proc. the 11th EDBT, March 2008, pp.205-216.Google Scholar
- Hua M, Pei J. Probabilistic path queries in road networks: Traffic uncertainty aware path selection. In Proc. the 13th EDBT, March 2010, pp.347-358.Google Scholar
- Yang B, Guo C, Jensen C S et al. Stochastic skyline route planning under time-varying uncertainty. In Proc. the 30th IEEE International Conference on Data Engineering, March 31-April 4, 2014, pp.136-147.Google Scholar
- Papadias D, Shen Q, Tao Y et al. Group nearest neighbor queries. In Proc. the 20th ICDE, March 30-April 2, 2004, pp.301-312.Google Scholar
- Shang S, Lu H, Pedersen T B et al. Finding traffic-aware fastest paths in spatial networks. In Proc. the 13th SSTD, Aug. 2013, pp.128-145.Google Scholar
- Shang S, Lu H, Pedersen T B et al. Modeling of trafficaware travel time in spatial networks. In Proc. the 14th IEEE MDM, June 2013, pp.247-250.Google Scholar
- Chen Z, Shen H T, Zhou X. Monitoring path nearest neighbor in road networks. In Proc. ACM SIGMOD, June 2009, pp.591-602.Google Scholar
- Zheng K, Shang S, Yuan N J et al. Towards efficient search for activity trajectories. In Proc. the 29th ICDE, April 2013, pp.230-241.Google Scholar
- Shang S, Ding R, Yuan B et al. User oriented trajectory search for trip recommendation. In Proc. the 15th EDBT, March 2012, pp.156-167.Google Scholar
- Wang F, Zhu Z. Global path planning of wheeled robots using multi-objective memetic algorithms. In Proc. the 14th IDEAL, Oct. 2013, pp.437-444.Google Scholar