Stochastic motion planning and applications to traffic

International Journal of Robotics Research

Volumn 30, Issue 6, 2011, Pages 699-712

  Lim, Sejoon ^a,b   Balakrishnan, Hari ^a   Gifford, David ^a   Madden, Samuel ^a   Rus, Daniela ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NONE   (United States)

Author keywords

Algorithm; Motion planning; Stochastic shortest path; Traffic navigation

Indexed keywords

ONBOARD NAVIGATION SYSTEMS; OPTIMAL SUBSTRUCTURES; ROAD NETWORK; ROAD TRAFFIC; SHORTEST PATH ALGORITHMS; STOCHASTIC MODELING; STOCHASTIC MOTION; STOCHASTIC SHORTEST PATHS; TRAVEL DELAYS; TWO-POINT;

ALGORITHMS; COMPUTER SIMULATION; HIGHWAY TRAFFIC CONTROL; MOTOR TRANSPORTATION; NAVIGATION; NAVIGATION SYSTEMS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; ROADS AND STREETS; STOCHASTIC SYSTEMS; MOTION PLANNING;

MOTION PLANNING; ALGORITHMS;

EID: 79959351823     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364910386259     Document Type: Article

References (16)

1. Bertsekas DP and Tsitsiklis JN (1991) An analysis of stochastic shortest path problems. Mathematics of Operations Research 16(3):580-595.
2. Carstensen, P (1983) The complexity of some problems in parametric linear and combinatorial programming. PhD thesis, Mathematics Department, University of Michigan, Ann Arbor, MI, January.
3. Chabini I (1998) Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Research Record 1645: 170-175. (Pubitemid 128550908)
4. Chrobok R, Wahle J and Schreckenberg M (2001) Traffic forecast using simulations of large scale networks. In: IEEE Conference on Intelligent Transportation Systems, Oakland, CA, USA, August 2001.
5. Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu AK, et al. (2006) CarTel: a distributed mobile sensor computing system. In: 4th ACM SenSys, Boulder, CO, November 2006.
6. Lim S, Balakrishnan H, Gifford D, Madden S and Rus D (2008) Stochastic motion planning and applications to traffic. In: Proceedings of the Eighth International Workshop on the Algorithmic Foundations of Robotics (WAFR), Guanajuato, Mexico, December 2008.
7. Loui R (1983) Optimal paths in graphs with stochastic or multidimensional weights. Communications of the ACM 26(9): 670-676. (Pubitemid 14466773)
8. Murthy I and Sarkar S (1997) Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function. European Jounal of Operational Research 103: 209-229. (Pubitemid 127396741)
9. Nikolova E, Brand M and Karger D (2006) Optimal route planning under uncertainty. In: International Conference on Automated Planning and Scheduling, Cumbria, UK / June 6-10, 2006.
10. Nikolova E, Kelner JA, Brand M and Mitzenmacher M (2006) Stochastic shortest paths via quasi-convex maximization. In: ESA, Zurich, Switzerland / Sep. 11-13, 2006.
11. Sanwal KK and Walrand J (1995) Vehicles as probes. Technical Report UCB-ITS-PWP-95-11, California Partners for Advanced Transit and Highways (PATH), January.
12. Schrank D and Lomax T (2007) The 2007 urban mobility report. Annual Report, Texas Transportation Institute, The Texas A&M University System, September.
13. Sigal CE, Pritsker AAB and Solberg JJ (1980) The stochastic shortest route problem. Operations Research 28(5): 1122-1129.
14. Wellman MP, Ford M and Larson K (1995) Path planning under time-dependent uncertainty. In: 11th Conference on Uncertainty in Artificial Intelligence, August 1995, 532-539.
15. Xu H and Dailey DJ (1995) Real time highway traffic simulation and prediction using inductance loop data. In: Vehicle Navigation and Information Systems Conference, Seattle, WA, USA, July 1995.
16. Yoon J, Noble B and Liu M (2007) Surface street traffic estimation. In: MobiSys '07: Proceedings of the 5th International Conference on Mobile Systems, Applications and services, New York, NY, 2007. ACM, 220-232. (Pubitemid 47620927)