Practical route planning under delay uncertainty: Stochastic shortest path queries

Robotics: Science and Systems

Volumn 8, Issue , 2013, Pages 249-256

  Lim, Sejoon ^a   Sommer, Christian ^a   Nikolova, Evdokia ^b   Rus, Daniela ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGRICULTURAL ROBOTS; DATA STRUCTURES; GRAPH THEORY; QUERY PROCESSING; ROBOTICS; STOCHASTIC SYSTEMS; TRAVEL TIME;

DELAY UNCERTAINTIES; EFFICIENT IMPLEMENTATION; LOGARITHMIC TIME; PROBABILISTIC MODELING; QUASI-LINEAR TIME; STATE OF THE ART; STOCHASTIC SHORTEST PATHS; TRAVEL TIME DISTRIBUTIONS;

STOCHASTIC MODELS;

EID: 84907012872     PISSN: None     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: 10.15607/rss.2012.viii.032     Document Type: Conference Paper

References (28)

1. I. Abraham and C. Gavoille. Object location using path separators. In 25th ACM Symposium on Principles of Distributed Computing (PODC), pages 188-197, 2006.
2. I. Abraham, A. Fiat, A. Goldberg, and R. Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010.
3. I. Abraham, D. Delling, A. Fiat, A. Goldberg, and R. Werneck. VC-dimension and shortest path algorithms. In 38th Int. Colloquium on Automata, Languages, and Programming (ICALP), pages 690-699, 2011.
4. Y. Bartal, L.-A. Gottlieb, T. Kopelowitz, M. Lewenstein, and L. Roditty. Fast, precise and dynamic distance queries. In 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 840-853, 2011.
5. H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast routing in road networks with transit nodes. Science, 316(5824):566, 2007.
6. R. Bauer and D. Delling. SHARC: Fast and robust unidirectional routing. ACM Journal of Experimental Algorithmics, 14, 2009.
7. T. Caldwell. On finding minimum routes in a network with turn penalties. Comm. of the ACM, 4(2), 1961.
8. D. Eppstein and M. T. Goodrich. Studying (non-planar) road networks through an algorithmic lens. In 16th ACM SIGSPATIAL Int. Symposium on Advances in Geographic Information Systems (GIS), page 16, 2008.
9. R. Geisberger and C. Vetter. Efficient routing in road networks with turn costs. In 10th Int. Symposium on Experimental Algorithms (SEA), pages 100-111, 2011.
10. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In 7th Int. Workshop on Experimental Algorithms (WEA), pages 319-333, 2008.
11. R. Geisberger, M. Kobitzsch, and P. Sanders. Route planning with flexible objective functions. In 12th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 124-137, 2010.
12. J. Greenfeld. Matching GPS observations to locations on a digital map. In 81st Annual Meeting of the Transportation Research Board, volume 1, 2002.
13. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms, 4(1), 2008.
14. K. Kawarabayashi, P. N. Klein, and C. Sommer. Linearspace approximate distance oracles for planar, boundedgenus and minor-free graphs. In 38th Int. Colloquium on Automata, Languages and Programming (ICALP), pages 135-146, 2011.
15. S. Lim, H. Balakrishnan, D. Gifford, S. Madden, and D. Rus. Stochastic motion planning and applications to traffic. International Journal of Robotics Research, 30 (6):699-712, 2011. Announced at WAFR 2008.
16. L. F. Muller and M. Zachariasen. Fast and compact oracles for approximate distances in planar graphs. In 15th European Symposium on Algorithms (ESA), pages 657-668, 2007.
17. P. Newson and J. Krumm. Hidden markov map matching through noise and sparseness. 17th ACM SIGSPATIAL Int. Conference on Advances in Geographic Information Systems (GIS), pages 336-343, 2009.
18. E. Nikolova. Approximation algorithms for reliable stochastic combinatorial optimization. In 13th Int. Workshop on Approximation, Randomization, and Combinatorial Optimization (APPROX), pages 338-351, 2010.
19. E. Nikolova, M. Brand, and D. R. Karger. Optimal route planning under uncertainty. In 16th Int. Conference on Automated Planning and Scheduling (ICAPS), pages 131-141, 2006.
20. E. Nikolova, J. A. Kelner, M. Brand, and M. Mitzenmacher. Stochastic shortest paths via quasi-convex maximization. In 14th European Symposium on Algorithms (ESA), pages 552-563, 2006.
21. P. Sanders and D. Schultes. Highway hierarchies hasten exact shortest path queries. In 13th European Symposium on Algorithms (ESA), pages 568-579, 2005.
22. R.-P. Schäfer. IQ routes and HD traffic: technology insights about TomTom's time-dynamic navigation concept. In Foundations of Software Engineering (SIGSOFT FSE), pages 171-172, 2009.
23. C. Sommer, E. Verbin, and W. Yu. Distance oracles for sparse graphs. In 50th IEEE Symposium on Foundations of Computer Science (FOCS), pages 703-712, 2009.
24. M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM, 51(6):993-1024, 2004.
25. M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM, 52(1):1-24, 2005.
26. TomTom. How TomTom's HD Traffic and IQ Routes data provides the very best routing-Travel time measurements using GSM and GPS probe data. White Paper.
27. C. White, D. Bernstein, and A. Kornhauser. Some map matching algorithms for personal navigation assistants. Transportation Research Part C: Emerging Technologies, 8(1-6):91-108, 2000.
28. S. Winter. Modeling costs of turns in route planning. GeoInformatica, 6(4):363-380, 2002.