Description
This data contains simulation results for the routing of 8 fleets of vehicles using a game-theoretic Nash equilibrium (NE) strategy, both offline and with a receding-horizon approach. Each fleet is capable of autonomous decisions and is referred to as an agent.
The vehicles aim at minimizing their time to destination in a non-cooperative fashion. For each fleet of vehicle, the control input is the probability of routing a vehicle of the fleet through each road.
https://github.com/bemilio/MDP_traffic_nonlinear
The vehicles aim at minimizing their time to destination in a non-cooperative fashion. For each fleet of vehicle, the control input is the probability of routing a vehicle of the fleet through each road.
https://github.com/bemilio/MDP_traffic_nonlinear
| Date made available | 6 Dec 2024 |
|---|---|
| Publisher | TU Delft - 4TU.ResearchData |
Research output
- 1 Article
-
Probabilistic Game-Theoretic Traffic Routing
Benenati, E. & Grammatico, S., 2024, In: IEEE Transactions on Intelligent Transportation Systems. 25, 10, p. 13080-13090 11 p.Research output: Contribution to journal › Article › Scientific › peer-review
Open AccessFile4 Link opens in a new tab Citations (Scopus)27 Downloads (Pure)
Cite this
- DataSetCite