Incentivizing Efficient Equilibria in Traffic Networks With Mixed Autonomy

Traffic congestion has large economic and social costs. The introduction of autonomous vehicles can potentially reduce this congestion by increasing road capacity via vehicle platooning and by creating an avenue for influencing people's choice of routes. We consider a network of parallel roads with two modes of transportation: 1) human drivers, who will choose the quickest route available to them, and 2) a ride hailing service, which provides an array of autonomous vehicle route options, each with different prices, to users. We formalize a model of vehicle flow in mixed autonomy and a model of how autonomous service users make choices between routes with different prices and latencies. Developing an algorithm to learn the preferences of the users, we formulate a planning optimization that chooses prices to maximize a social objective. We demonstrate the benefit of the proposed scheme by comparing the results to theoretical benchmarks that, we show, can be efficiently calculated.

[1]  Dorsa Sadigh,et al.  Asking Easy Questions: A User-Friendly Approach to Active Reward Learning , 2019, CoRL.

[2]  R. Luce,et al.  Individual Choice Behavior: A Theoretical Analysis. , 1960 .

[3]  Anind K. Dey,et al.  Maximum Entropy Inverse Reinforcement Learning , 2008, AAAI.

[4]  A. Sumalee,et al.  First-best marginal cost toll for a traffic network with stochastic demand , 2011 .

[5]  Maria Laura Delle Monache,et al.  Dissipation of stop-and-go waves via control of autonomous vehicles: Field experiments , 2017, ArXiv.

[6]  Morteza Zadimoghaddam,et al.  Efficiently Learning from Revealed Preference , 2012, WINE.

[7]  Madeleine Udell,et al.  Revealed Preference at Scale: Learning Personalized Preferences from Assortment Choices , 2015, EC.

[8]  Philip N. Brown,et al.  The Robustness of Marginal-Cost Taxes in Affine Congestion Games , 2017, IEEE Transactions on Automatic Control.

[9]  Eyke Hüllermeier,et al.  Preference-Based Policy Iteration: Leveraging Preference Learning for Reinforcement Learning , 2011, ECML/PKDD.

[10]  Anca D. Dragan,et al.  Active Preference-Based Learning of Reward Functions , 2017, Robotics: Science and Systems.

[11]  Jorge Nocedal,et al.  An interior algorithm for nonlinear optimization that combines line search and trust region steps , 2006, Math. Program..

[12]  P. Dayan,et al.  Cortical substrates for exploratory decisions in humans , 2006, Nature.

[13]  E. Verhoef,et al.  Preference heterogeneity and congestion pricing: The two route case revisited , 2018, Transportation Research Part B: Methodological.

[14]  Alexandre M. Bayen,et al.  Stabilizing Traffic with Autonomous Vehicles , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[15]  R. Duncan Luce,et al.  Individual Choice Behavior: A Theoretical Analysis , 1979 .

[16]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[17]  Pieter Abbeel,et al.  Exploration and apprenticeship learning in reinforcement learning , 2005, ICML.

[18]  Vijay Gupta,et al.  Localization of disturbances in transportation systems , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[19]  Mohammad Mahdian,et al.  Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[20]  William H. Sandholm,et al.  Evolutionary Implementation and Congestion Pricing , 2002 .

[21]  Pravin Varaiya,et al.  Effect of adaptive and cooperative adaptive cruise control on throughput of signalized arterials , 2017, 2017 IEEE Intelligent Vehicles Symposium (IV).

[22]  Mykel J. Kochenderfer,et al.  Active preference-based Gaussian process regression for reward learning and optimization , 2020, Robotics: Science and Systems.

[23]  Moshe Ben-Akiva,et al.  Discrete Choice Analysis: Theory and Application to Travel Demand , 1985 .

[24]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[25]  Dorsa Sadigh,et al.  Altruistic Autonomy: Beating Congestion on Shared Roads , 2018, WAFR.

[26]  Kwang Mong Sim,et al.  The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands , 2003, Oper. Res. Lett..

[27]  Karl Henrik Johansson,et al.  Modeling the Impact of Vehicle Platooning on Highway Congestion: A Fluid Queuing Approach , 2018, HSCC.

[28]  Marco Pavone,et al.  A Congestion-aware Routing Scheme for Autonomous Mobility-on-Demand Systems , 2019, 2019 18th European Control Conference (ECC).

[29]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[30]  Andrew Y. Ng,et al.  Pharmacokinetics of a novel formulation of ivermectin after administration to goats , 2000, ICML.

[31]  Philip N. Brown,et al.  Fundamental limits of locally-computed incentives in network routing , 2017, 2017 American Control Conference (ACC).

[32]  Jennie Lioris,et al.  Platoons of connected vehicles can double throughput in urban roads , 2015, 1511.00775.

[33]  Daniel A. Lazar,et al.  Learning How to Dynamically Route Autonomous Vehicles on Shared Roads , 2019, ArXiv.

[34]  C. Daganzo THE CELL TRANSMISSION MODEL.. , 1994 .

[35]  Roberto Horowitz,et al.  Can the Presence of Autonomous Vehicles Worsen the Equilibrium State of Traffic Networks? , 2018, 2018 IEEE Conference on Decision and Control (CDC).

[36]  Alexandre M. Bayen,et al.  Stackelberg Routing on Parallel Transportation Networks , 2017 .

[37]  Clóvis C. Gonzaga,et al.  Path-Following Methods for Linear Programming , 1992, SIAM Rev..