Incentivizing Efficient Equilibria in Traffic Networks with Mixed Autonomy

• URL: http://arxiv.org/abs/2106.04678v1
• Date: Thu, 6 May 2021 03:01:46 GMT
• Title: Incentivizing Efficient Equilibria in Traffic Networks with Mixed Autonomy
• Authors: Erdem B{\i}y{\i}k, Daniel A. Lazar, Ramtin Pedarsani, Dorsa Sadigh
• Abstract summary: Vehicle platooning can potentially reduce traffic congestion by increasing road capacity via vehicle platooning. We consider a network of parallel roads with two modes of transportation: (i) human drivers, who will choose the quickest route available to them, and (ii) 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.
• Score: 17.513581783749707
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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: (i) human drivers, who will choose the quickest route available to them, and (ii) 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 which we show can be efficiently calculated.

Related papers

• Personalized and Context-aware Route Planning for Edge-assisted Vehicles [11.39182190564773]
  We propose a novel approach based on graph neural networks (GNNs) and deep reinforcement learning (DRL) By analyzing the historical trajectories of individual drivers, we classify it with relevant road attributes as indicators of driver preferences. We evaluate our proposed GNN-based DRL framework using a real-world road network and demonstrate its ability to accommodate driver preferences.
  arXiv  Detail & Related papers  (2024-07-25T12:14:12Z)
• A Bi-Objective Approach to Last-Mile Delivery Routing Considering Driver Preferences [42.16665455951525]
  The Multi-Objective Vehicle Routing Problem (MOVRP) is a complex optimization problem in the transportation and logistics industry. This paper proposes a novel approach to the MOVRP that aims to create routes that consider drivers' and operators' decisions and preferences. We evaluate two approaches to address this objective: visually attractive route planning and data mining of historical driver behavior to plan similar routes.
  arXiv  Detail & Related papers  (2024-05-25T04:25:00Z)
• Traffic Smoothing Controllers for Autonomous Vehicles Using Deep Reinforcement Learning and Real-World Trajectory Data [45.13152172664334]
  We design traffic-smoothing cruise controllers that can be deployed onto autonomous vehicles. We leverage real-world trajectory data from the I-24 highway in Tennessee. We show that at a low 4% autonomous vehicle penetration rate, we achieve significant fuel savings of over 15% on trajectories exhibiting many stop-and-go waves.
  arXiv  Detail & Related papers  (2024-01-18T00:50:41Z)
• Studying the Impact of Semi-Cooperative Drivers on Overall Highway Flow [76.38515853201116]
  Semi-cooperative behaviors are intrinsic properties of human drivers and should be considered for autonomous driving. New autonomous planners can consider the social value orientation (SVO) of human drivers to generate socially-compliant trajectories. We present study of implicit semi-cooperative driving where agents deploy a game-theoretic version of iterative best response.
  arXiv  Detail & Related papers  (2023-04-23T16:01:36Z)
• Decision Making for Autonomous Driving in Interactive Merge Scenarios via Learning-based Prediction [39.48631437946568]
  This paper focuses on the complex task of merging into moving traffic where uncertainty emanates from the behavior of other drivers. We frame the problem as a partially observable Markov decision process (POMDP) and solve it online with Monte Carlo tree search. The solution to the POMDP is a policy that performs high-level driving maneuvers, such as giving way to an approaching car, keeping a safe distance from the vehicle in front or merging into traffic.
  arXiv  Detail & Related papers  (2023-03-29T16:12:45Z)
• An ASP Framework for Efficient Urban Traffic Optimization [0.0]
  This paper presents a framework which allows to efficiently simulate and optimize traffic flow in a large roads' network with hundreds of vehicles. The framework leverages on an Answer Set Programming (ASP) encoding to formally describe the movements of vehicles inside a network. It is then possible to optimize the routes of vehicles inside the network to reduce a range of relevant metrics.
  arXiv  Detail & Related papers  (2022-08-05T10:50:38Z)
• End-to-End Intersection Handling using Multi-Agent Deep Reinforcement Learning [63.56464608571663]
  Navigating through intersections is one of the main challenging tasks for an autonomous vehicle. In this work, we focus on the implementation of a system able to navigate through intersections where only traffic signs are provided. We propose a multi-agent system using a continuous, model-free Deep Reinforcement Learning algorithm used to train a neural network for predicting both the acceleration and the steering angle at each time step.
  arXiv  Detail & Related papers  (2021-04-28T07:54:40Z)
• Balancing Fairness and Efficiency in Traffic Routing via Interpolated Traffic Assignment [29.556405472628402]
  Interpolated Traffic Assignment Problem (I-TAP) is a convex program that interpolates between a fairness-promoting and an efficiency-promoting traffic-assignment objective. We present a numerical comparison between I-TAP and a state-of-the-art algorithm on a range of transportation networks.
  arXiv  Detail & Related papers  (2021-03-31T20:32:52Z)
• End-to-end Interpretable Neural Motion Planner [78.69295676456085]
  We propose a neural motion planner (NMP) for learning to drive autonomously in complex urban scenarios. We design a holistic model that takes as input raw LIDAR data and a HD map and produces interpretable intermediate representations. We demonstrate the effectiveness of our approach in real-world driving data captured in several cities in North America.
  arXiv  Detail & Related papers  (2021-01-17T14:16:12Z)
• PassGoodPool: Joint Passengers and Goods Fleet Management with Reinforcement Learning aided Pricing, Matching, and Route Planning [29.73314892749729]
  We present a demand aware fleet management framework for combined goods and passenger transportation. Our proposed model is deployable independently within each vehicle as this minimizes computational costs associated with the growth of distributed systems.
  arXiv  Detail & Related papers  (2020-11-17T23:15:03Z)
• A Distributed Model-Free Ride-Sharing Approach for Joint Matching, Pricing, and Dispatching using Deep Reinforcement Learning [32.0512015286512]
  We present a dynamic, demand aware, and pricing-based vehicle-passenger matching and route planning framework. Our framework is validated using the New York City Taxi dataset. Experimental results show the effectiveness of our approach in real-time and large scale settings.
  arXiv  Detail & Related papers  (2020-10-05T03:13:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.