Decentralized Decision-Making among Heterogeneous Autonomous Vehicles: An -Potential Game Framework
Organizations: Department of Industrial Engineering and Operations Research, Columbia University · Department of Mathematics, Imperial College London, London, UK · Department of Civil Engineering and Engineering Mechanics, Data Science Institute, Columbia University
Abstract
We study noncooperative multi-vehicle games among heterogeneous autonomous vehicles, where each vehicle adopts a decentralized closed-loop policy based on its own state, and optimizes an objective that depends on other vehicles through potentially asymmetric interaction weights. We develop an -potential game framework that reduces the computation of an approximate Nash equilibrium (NE) to the minimization of a single auxiliary -potential function. We explicitly construct this -potential, establish the existence of its minimizers, and characterize the equilibrium approximation error in terms of interaction asymmetry. We further introduce vehicle-specific scaling to reduce the effective interaction asymmetry, thereby tightening the equilibrium approximation and, in important cases, recovering an exact NE despite asymmetric interactions. We also derive social-efficiency guarantees for the potential-selected policies, revealing how the interaction structure shapes worst-case efficiency. Numerical experiments demonstrate the flexibility of the framework in capturing heterogeneous vehicle interactions, collision and obstacle avoidance, lane changing and overtaking under different traffic configurations, and priority-based intersection crossing.
Figures & tables
| Scenario (Section) | Dim. | Control | Experiment | Goal |
|---|---|---|---|---|
| Interaction regimes ( 5.1.1 ) | 1D | Velocity; acceleration | 10 vehicles; weak versus strong interactions ( versus ) (Figures 1 and 2 ) | Compare separation and collision avoidance |
| Scalability ( 5.1.1 ) | 1D | Velocity | 30 vehicles; strong interactions ( ) (Figure 3 ) | Assess scalability to a larger number of vehicles |
| Obstacle avoidance ( 5.1.2 ) | 2D | Acceleration | 10 vehicles; no obstacle, or a circular obstacle of radius or (Figure 4 ) | Assess trajectory responses to obstacle size |
| Rescaling ( 5.1.3 ) | 1D | Velocity; acceleration | 9 vehicles with asymmetric interactions (Figure 5 ); exploitability before and after rescaling (Table 3 ) | Assess size-dependent equilibrium behavior; Evaluate improvement in Nash approximation |
| Lane changing ( 5.2 ) | 2D | Velocity | 3 vehicles, 2 lanes; two initial layouts with identical costs and target speeds (Figure 6 ) | Compare lane changes and overtaking behavior |
| Intersection crossing ( 5.3 ) | 2D | Acceleration | 8 vehicles; same initial conditions, with versus without major–minor-road differentiation (Figure 7 ) | Assess road-priority effects on yielding and crossing |
| Vehicle | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|---|---|---|---|---|---|---|---|---|---|
| 0.115 | 0.117 | 0.095 | 0.395 | 0.319 | 0.347 | 1.805 | 2.235 | 2.353 | |
| 10 | 10 | 10 | 3 | 3 | 3 | 0.5 | 0.5 | 0.5 |
| Vehicle | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Scaling | Metric | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| Before | Cost | 5.336 | 3.774 | 1.458 | 4.974 | 3.830 | 4.736 | 11.168 | 16.183 | 11.832 |
| Relative exploitability (%) | 64.679 | 49.945 | 12.646 | 18.740 | 22.354 | 23.210 | 3.640 | 0.008 | 0.009 | |
| After | Cost | 1.637 | 1.712 | 1.642 | 5.258 | 4.497 | 7.148 | 8.930 | 13.070 | 13.290 |
| Relative exploitability (%) | 0.180 | 0.795 | 0.928 | 1.598 | 1.145 | 0.927 | 3.717 | 0.962 | 2.275 | |
| Parameter | ||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Value | 10.0 | 0.1 | 1.0 | 8.0 | 100.0 | 20.0 | 1.0 | 5.0 | 10.0 | 0.1 | 50 | 0.5 | 1.5 | 0.9 |
| Parameter | ||||||
|---|---|---|---|---|---|---|
| Value | 0.1 | 1.0 | 10.0 | 10.0 | 5.0 | 10.0 |