Routing for Traffic Networks With Mixed Autonomy

@article{Lazar2021RoutingFT,
  title={Routing for Traffic Networks With Mixed Autonomy},
  author={Daniel A. Lazar and Samuel D. Coogan and Ramtin Pedarsani},
  journal={IEEE Transactions on Automatic Control},
  year={2021},
  volume={66},
  pages={2664-2676}
}
In this article, we propose a macroscopic model for studying routing on networks shared between human-driven and autonomous vehicles that captures the effects of autonomous vehicles forming platoons. We use this to study inefficiency due to selfish routing and bound the price of anarchy (PoA), the maximum ratio between total delay experienced by selfish users and the minimum possible total delay. To do so, we establish two road capacity models, each corresponding to an assumption regarding the… Expand
Optimal Tolling for Multitype Mixed Autonomous Traffic Networks
TLDR
It is shown that unless a planner can differentiate between vehicle types in the tolls given, the resulting equilibrium can be unboundedly worse than the optimal routing, and that marginal cost tolling fails in the setting. Expand
Optimal Tolling for Heterogeneous Traffic Networks with Mixed Autonomy
TLDR
This work considers a network of parallel roads with affine latency functions that are heterogeneous, meaning that the increase in capacity due to to the presence of autonomous vehicles may vary from road to road, and designs tolls that are guaranteed to minimize social cost at equilibrium. Expand
The Role of Differentiation in Tolling of Traffic Networks with Mixed Autonomy
TLDR
This work establishes differentiated tolls which completely eliminate inefficiency due to selfish routing, and establishes a lower bound on the inefficiency of variable marginal cost tolling in the mixed autonomy setting. Expand
Anonymous Tolling for Traffic Networks with Mixed Autonomy
TLDR
This work provides the first optimal tolls for the mixed autonomous setting in general networks with multiple source-destination pairs, where road latencies are affine functions of vehicle flow and differentiated tolls are differentiated, meaning that the different vehicle types must be given different toll values. Expand
Smart Navigation via Strategic Communications in a Mixed Autonomous Paradigm
TLDR
It is found that it is optimal for the system to randomize in providing traffic information rather than to provide perfect information to HVs, and credibility constraint limits the social planner's persuasion power in navigating HVs away from overcrowding the more desirable route. Expand
Maximizing Road Capacity Using Cars that Influence People
TLDR
This paper characterize the increase in road capacity afforded by platooning, as well as the vehicle configuration that maximizes road capacity, and presents a novel algorithm that uses a low-level control framework to leverage local interactions to optimally rearrange vehicles. Expand
The Green Choice: Learning and Influencing Human Decisions on Shared Roads
TLDR
This work formalizes a model of how autonomous service users make choices between routes with different price/delay values and forms a planning optimization to maximize a social objective and demonstrates the benefit of the proposed routing and learning scheme. Expand
A Hybrid Queuing Model for Coordinated Vehicle Platooning on Mixed-Autonomy Highways: Training and Validation
TLDR
A hybrid queuing model for a mixed-autonomy highway section and an easy-to-use training algorithm that can directly support model-predictive decision making for platooning in mixed autonomy are considered. Expand
Efficient Algorithms for Stochastic Ridepooling Assignment with Mixed Fleets
TLDR
Two approximation algorithms for mid-capacity and high-capacity vehicles are proposed in this paper; the respective approximation ratios are 1 p2 and e−1 (2e+o(1))p lnp, where p is the maximum vehicle capacity plus one. Expand
Analysis and Design of Vehicle Platooning Operations on Mixed-Traffic Highways
TLDR
A new fluid model of mixed-autonomy traffic flow is introduced that considers randomly arriving platoons sharing highway capacity with non-CAVs and is useful for designing platoon coordination strategies that maximize throughput and minimize delay. Expand
...
1
2
...

References

SHOWING 1-10 OF 53 REFERENCES
The Price of Anarchy for Transportation Networks with Mixed Autonomy*
We study routing behavior in transportation networks with mixed autonomy, that is, networks in which a fraction of the vehicles on each road are equipped with autonomous capabilities such as adaptiveExpand
Can the Presence of Autonomous Vehicles Worsen the Equilibrium State of Traffic Networks?
TLDR
It is proved that for heterogeneous degrees of capacity asymmetry, the total delay is not unique, and it can further grow when the fraction of autonomous vehicles increases, and similar behaviors may be observed in networks with multiple O/D pairs. Expand
Routing Autonomous Vehicles in Congested Transportation Networks: Structural Properties and Coordination Algorithms
TLDR
Numerical experiments and case studies corroborate the theoretical insights and show that the proposed algorithm outperforms state-of-the-art point-to-point methods by avoiding excess congestion on the road. Expand
Capacity modeling and routing for traffic networks with mixed autonomy
TLDR
Two models for road capacity under mixed autonomy that are based on the fundamental behavior of autonomous technologies such as adaptive cruise control are developed, and an optimal routing problem of mixed traffic is formulated for the first capacity model with two parallel roads. Expand
How bad is selfish routing?
TLDR
It is proved that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency (subject to the condition that all traffic must be routed). Expand
The price of anarchy is independent of the network topology
TLDR
It is shown that under weak hypotheses on the class of allowable edge latency functions, the worst-case ratio between the total latency of a Nash equilibrium and of a minimum-latency routing for any multicommodity flow network is achieved by a single-commodity instance on a set of parallel links. Expand
Modeling the Impact of Vehicle Platooning on Highway Congestion: A Fluid Queuing Approach
TLDR
A new fluid queuing model is proposed to study the macroscopic interaction between randomly arriving vehicle platoons and the background traffic at highway bottlenecks and reveals a basic tradeoff between congestion induced by the randomness of platoon arrivals, and efficiency gain due to a tighter intra-platoon spacing. Expand
Optimal Policies for Platooning and Ride Sharing in Autonomy-Enabled Transportation
TLDR
This paper considers a class of problems, applicable to vehicle platooning and passenger ride-sharing, from the systems perspective, and derives the Pareto-optimal boundary and characterization of the optimal polices in both the open-loop and feedback regimes. Expand
Platoons of connected vehicles can double throughput in urban roads
TLDR
It is argued that saturation flow rates, and hence intersection capacity, can be doubled or tripled by platooning, and the argument is supported by the analysis of three queuing models and by the simulation of a road network with 16 intersections and 73 links. Expand
Altruistic Autonomy: Beating Congestion on Shared Roads
TLDR
This work develops a formal model of road congestion on shared roads based on the fundamental diagram of traffic, considers a network of parallel roads and provides algorithms that compute optimal equilibria that are robust to additional unforeseen demand and plans for optimal routings when users have varying degrees of altruism. Expand
...
1
2
3
4
5
...