Congestion-aware traffic routing for large-scale mobile agent systems

Traffic congestion is a serious world-wide problem. Drivers have little knowledge of historical and real-time traffic congestion for the paths they take and often tend to drive suboptimal routes. Congestion phenomena are sure to be influenced by the coming of autonomous cars. This thesis presents route planning algorithms and a system for either autonomous or human-driven cars in road networks dealing with travel time uncertainty and congestion. First, a stochastic route planning algorithm is presented that finds the best path for a group of multiple agents. Our algorithm provides mobile agents with optimized routes to achieve time-critical goals. Optimal selections of agent and visit locations are determined to guarantee the highest probability of task achievement while dealing with uncertainty of travel time. Furthermore, we present an efficient approximation algorithm for stochastic route planning based on pre-computed data for stochastic networks. Second, we develop a distributed congestion-aware multi-agent path planning algorithm that achieves the social optimum, minimizing aggregate travel time of all the agents in the system. As the number of agents grows, congestion created by agents' path choices should be considered. Using a data-driven congestion model that describes the travel time as a function of the number of agents on a road segment, we develop a practical method for determining the optimal paths for all the agents in the system to achieve the social optimum. Our algorithm uses localized information and computes the paths in a distributed manner. We implement the algorithm in multi-core computers and demonstrate that the algorithm has a good scalability. Third, a path planning system using traffic sensor data is then implemented. We predict the traffic speed and flow for each location from a large set of sensor data collected from roving taxis and inductive loop detectors. Our system uses a data-driven traffic model that captures important traffic patterns and conditions using the two sources of data. We evaluate the system using a rich set of GPS traces from 16,000 taxis in Singapore and show that the city-scale congestion can be mitigated by planning drivers' routes, while incorporating the congestion effects generated by their route choices. (Copies available exclusively from MIT Libraries, libraries.mit.edu/docs - docs@mit.edu)

[1]  Daniel Delling,et al.  SHARC: Fast and robust unidirectional routing , 2008, JEAL.

[2]  Michel Bierlaire,et al.  An Efficient Algorithm for Real-Time Estimation and Prediction of Dynamic OD Tables , 2004, Oper. Res..

[3]  Dietrich E. Wolf,et al.  Cellular automata for traffic simulations , 1999 .

[4]  Liu Yuncai,et al.  An Improved Car-Following Model for Multiphase Vehicular Traffic Flow and Numerical Tests , 2006 .

[5]  Markos Papageorgiou,et al.  Traffic flow modeling of large-scale motorwaynetworks using the macroscopic modeling tool METANET , 2002, IEEE Trans. Intell. Transp. Syst..

[6]  Moshe Lewenstein,et al.  Fast, precise and dynamic distance queries , 2011, SODA '11.

[7]  Eitan Altman,et al.  Equilibria for multiclass routing in multi-agent networks , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[8]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[9]  Mingyan Liu,et al.  Surface street traffic estimation , 2007, MobiSys '07.

[10]  Todd Litman,et al.  MEASURING TRANSPORTATION: TRAFFIC, MOBILITY, AND ACCESSIBILITY , 2003 .

[11]  James J. Solberg,et al.  The Stochastic Shortest Route Problem , 1980, Oper. Res..

[12]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[13]  N. Geroliminis,et al.  An analytical approximation for the macropscopic fundamental diagram of urban traffic , 2008 .

[14]  Patricia J. Carstensen.  The complexity of some problems in parametric linear and combinatorial programming , 1983 .

[15]  Martin L. Hazelton,et al.  Statistical inference for time varying origin–destination matrices , 2008 .

[16]  A. Bayen,et al.  A traffic model for velocity data assimilation , 2010 .

[17]  R. Cheung.  Iterative methods for dynamic stochastic shortest path problems , 1998 .

[18]  Joachim Gudmundsson,et al.  Approximate distance oracles for geometric spanners , 2008, TALG.

[19]  Daniela Rus,et al.  Stochastic distributed multi-agent planning and applications to traffic , 2012, 2012 IEEE International Conference on Robotics and Automation.

[20]  Arnim H. Meyburg,et al.  SURVEY METHODS FOR TRANSPORT PLANNING , 1995 .

[21]  Jung-Hoon Lee,et al.  A real-time traffic control scheme of multiple AGV systems for collision free minimum time motion: a routing table approach , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[22]  H. M. Zhang,et al.  A Car-Following Theory for Multiphase Vehicular Traffic Flow , 2003 .

[23]  S. Sarkar,et al.  Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions , 1998 .

[24]  Shantayanan Devarajan,et al.  A note of network equilibrium and noncooperative games , 1981 .

[25]  Hai Yang,et al.  A stochastic user equilibrium assignment model for congested transit networks , 1999 .

[26]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[27]  Larry J. LeBlanc,et al.  A comparison of user-optimum versus system-optimum traffic assignment in transportation network design , 1984 .

[28]  Andrew W. Moore,et al.  K-means and Hierarchical Clustering , 2004 .

[29]  Martin L. Hazelton,et al.  Statistical Inference for Transit System Origin-Destination Matrices , 2010, Technometrics.

[30]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[31]  S. Sarkar,et al.  Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function , 1997 .

[32]  Alexandre M. Bayen,et al.  Optimal decomposition of travel times measured by probe vehicles using a statistical traffic flow model , 2011, 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[33]  XiangMo Zhao,et al.  Traffic flow time series prediction based on statistics learning theory , 2002, Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems.

[34]  David R. Karger,et al.  Optimal Route Planning under Uncertainty , 2006, ICAPS.

[35]  Yang Zhang,et al.  CarTel: a distributed mobile sensor computing system , 2006, SenSys '06.

[36]  Alexandre M. Bayen,et al.  An adaptive routing system for location-aware mobile devices on the road network , 2011, 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[37]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[38]  Bart De Moor,et al.  Transportation Planning and Traffic Flow Models , 2005 .

[39]  Carlos F. Daganzo,et al.  On Stochastic Models of Traffic Assignment , 1977 .

[40]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[41]  Mike McDonald,et al.  ITS and Traffic Management , 2007 .

[42]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[43]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[44]  Yueyue Fan,et al.  Shortest paths in stochastic networks with correlated link costs , 2005 .

[45]  Mikkel Thorup,et al.  Compact oracles for reachability and approximate distances in planar digraphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[46]  Wei Yu,et al.  Distance Oracles for Sparse Graphs , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[47]  Martin A. Ferman,et al.  A simple analytical model of a probe-based traffic information system , 2003, Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems.

[48]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[49]  Tong Li,et al.  Modelling traffic flow with a time‐dependent fundamental diagram , 2004 .

[50]  Dinesh Manocha,et al.  Self-Aware Traffic Route Planning , 2011, AAAI.

[51]  Fabián A. Chudak,et al.  Stattic Traffic Assignment Problem: A comparison between Beckmann (1956) and Nesterov & De Palma (1998) models , 2007 .

[52]  Eric Horvitz,et al.  Prediction, Expectation, and Surprise: Methods, Designs, and Study of a Deployed Traffic Forecasting Service , 2005, UAI.

[53]  Michael P. Wellman.  A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[54]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[55]  Nicholas Roy,et al.  Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries , 2013 .

[56]  Robert Geisberger,et al.  Efficient Routing in Road Networks with Turn Costs , 2011, SEA.

[57]  Sumit Sarkar,et al.  A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems , 1996, Transp. Sci..

[58]  Sang Nguyen,et al.  A unified framework for estimating or updating origin/destination matrices from traffic counts , 1988 .

[59]  Martin L. Hazelton,et al.  Inference for origin–destination matrices: estimation, prediction and reconstruction , 2001 .

[60]  David Eppstein,et al.  Studying (non-planar) road networks through an algorithmic lens , 2008, GIS '08.

[61]  Amos Fiat,et al.  Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.

[62]  Hein Botma,et al.  Assessment of Roadway Capacity Estimation Methods , 1996 .

[63]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[64]  J. Tsitsiklis,et al.  Stochastic shortest path problems with recourse , 1996 .

[65]  Thomas C. M. Lee,et al.  An Introduction to Coding Theory and the Two‐Part Minimum Description Length Principle , 2001 .

[66]  Ken-ichi Kawarabayashi,et al.  Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs , 2011, ICALP.

[67]  Hari Balakrishnan,et al.  Stochastic Motion Planning and Applications to Traffic , 2008, WAFR.

[68]  Mac Schwager,et al.  Decentralized, Adaptive Coverage Control for Networked Robots , 2009, Int. J. Robotics Res..

[69]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[70]  Ittai Abraham,et al.  Object location using path separators , 2006, PODC '06.

[71]  Martin L. Hazelton,et al.  Estimation of origin-destination matrices from link flows on uncongested networks , 2000 .

[72]  Kai Nagel,et al.  Still Flowing: Approaches to Traffic Flow and Traffic Jam Modeling , 2003, Oper. Res..

[73]  Matthew Brand,et al.  Stochastic Shortest Paths Via Quasi-convex Maximization , 2006, ESA.

[74]  David Bernstein,et al.  Some map matching algorithms for personal navigation assistants , 2000 .

[75]  Teodor Gabriel Crainic,et al.  Computing Shortest Paths with Logistic Constraints , 2007 .

[76]  Markos Papageorgiou,et al.  Parameter identification for a traffic flow model , 1979, Autom..

[77]  Jan-Ming Ho,et al.  Travel time prediction with support vector regression , 2003, Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems.

[78]  Peter Sanders,et al.  Route Planning with Flexible Objective Functions , 2010, ALENEX.

[79]  M. Goursat,et al.  Derivation of the fundamental traffic diagram for two circular roads and a crossing using minplus algebra and Petri net modeling. , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[80]  Michael P. Wellman,et al.  Path Planning under Time-Dependent Uncertainty , 1995, UAI.

[81]  Warrren B Powell,et al.  The Convergence of Equilibrium Algorithms with Predetermined Step Sizes , 1982 .

[82]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .

[83]  Stephan Winter,et al.  Modeling Costs of Turns in Route Planning , 2002, GeoInformatica.

[84]  P. Wagner,et al.  Metastable states in a microscopic model of traffic flow , 1997 .

[85]  Alexandre M. Bayen,et al.  Traffic flow reconstruction using mobile sensors and loop detector data , 2007 .

[86]  Hillel Bar-Gera,et al.  Differences among Route Flow Solutions for the User-Equilibrium Traffic Assignment Problem , 2007 .

[87]  John Krumm,et al.  Hidden Markov map matching through noise and sparseness , 2009, GIS.

[88]  Hyunmyung Kim,et al.  MULTIPLE-VEHICLE ORIGIN--DESTINATION MATRIX ESTIMATION FROM TRAFFIC COUNTS USING GENETIC ALGORITHM , 2004 .

[89]  Daniela Rus,et al.  Stochastic motion planning with path constraints and application to optimal agent, resource, and route planning , 2012, 2012 IEEE International Conference on Robotics and Automation.

[90]  Peter Sanders,et al.  Fast Routing in Road Networks with Transit Nodes , 2007, Science.

[91]  Alon Itai,et al.  On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[92]  Michael G.H. Bell,et al.  Risk-averse user equilibrium traffic assignment: an application of game theory , 2002 .

[93]  Sebastian Thrun,et al.  Stanley: The robot that won the DARPA Grand Challenge , 2006, J. Field Robotics.

[94]  Michel Pasquier,et al.  POP-TRAFFIC: a novel fuzzy neural approach to road traffic analysis and prediction , 2006, IEEE Transactions on Intelligent Transportation Systems.

[95]  Antonio Cantoni,et al.  Optimal Curve Fitting With Piecewise Linear Functions , 1971, IEEE Transactions on Computers.

[96]  Bret Hull.  Opportunistic sensing and mobile data delivery in the CarTel System , 2010 .

[97]  J. Greenfeld.  MATCHING GPS OBSERVATIONS TO LOCATIONS ON A DIGITAL MAP , 2002 .

[98]  Panos G Michalopoulos,et al.  IMPROVED ESTIMATION OF TRAFFIC FLOW FOR REAL-TIME CONTROL (DISCUSSION AND CLOSURE) , 1981 .

[99]  Mikkel Thorup,et al.  Approximate distance oracles , 2005, J. ACM.

[100]  Amos Fiat,et al.  VC-Dimension and Shortest Path Algorithms , 2011, ICALP.

[101]  Ralf-Peter Schäfer.  IQ routes and HD traffic: technology insights about tomtom's time-dynamic navigation concept , 2009, ESEC/FSE '09.

[102]  Rolf H. Möhring,et al.  System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion , 2022 .

[103]  Alexandre M. Bayen,et al.  An ensemble Kalman filtering approach to highway traffic estimation using GPS enabled mobile devices , 2008, 2008 47th IEEE Conference on Decision and Control.

[104]  Peter Sanders,et al.  Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.

[105]  A. Schadschneider,et al.  Metastable states in cellular automata for traffic flow , 1998, cond-mat/9804170.

[106]  Qiuqi Ruan,et al.  A Hierarchical Approach for the Shortest Path Problem with Obligatory Intermediate Nodes , 2006, 2006 8th international Conference on Signal Processing.

[107]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[108]  Dongjoo Park,et al.  Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty , 2003 .

[109]  Evdokia Nikolova,et al.  Approximation Algorithms for Reliable Stochastic Combinatorial Optimization , 2010, APPROX-RANDOM.

[110]  Ludovic Leclercq,et al.  A mechanism to describe the formation and propagation of stop-and-go waves in congested freeway traffic , 2010, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[111]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[112]  André Langevin,et al.  Scheduling and routing of automated guided vehicles: A hybrid approach , 2007, Comput. Oper. Res..

[113]  C. Gawron,et al.  An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model , 1998 .

[114]  Tom Caldwell,et al.  On finding minimum routes in a network with turn penalties , 1961, CACM.

[115]  Ludovic Leclercq,et al.  Fundamental Diagram Estimation Through Passing Rate Measurements in Congestion , 2009, IEEE Transactions on Intelligent Transportation Systems.

[116]  Martin A. Ferman,et al.  A simulation evaluation of a real-time traffic information system using probe vehicles , 2003, Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems.

[117]  Howard Slavin,et al.  Empirical Test of Alternative Traffic Assignment Methods , 2006 .

[118]  Ning Wu,et al.  A new approach for modeling of Fundamental Diagrams , 2002 .