cff-version: 1.2.0
abstract: "<p>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.</p><p><br></p><p>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.</p><p><br></p><p><strong><u>Receding-horizon test</u></strong></p><p>The receding-horizon test is performed over N cases, where for each test the initial condition and final destination of each fleet of vehicles is randomly generated. For each test, we produce a control action for T={1,3,4,5,8} control horizon.</p><p><br></p><p><strong>Data format for receding-horizon test:</strong></p><p>The result of each test is stored in a file, resulting in N files for the receding-horizon test. The code is in Python and the data is in format .pkl which serializes the following data:</p><p><br></p><ul><li>x: dictionary that maps from the tuple (n, t) to a pytorch vector of shape (I, n_x, T_sim ) which contains the sequence in time of a decision variable of each agent, where:</li></ul><p>n is the test index. In this specific case, there is only one test per file indexed as 0</p><p>t is the control horizon being tested</p><p>I is the number of agents</p><p>n_x is the dimension of the decision variable of each agent</p><p>T_sim is the length in timesteps of the simulation</p><ul><li>x_baseline: pytorch tensor of dimension (N, n_x, T_sim*n_x), where N is the number of tests performed, which contains the decision variables of each agent using the baseline solution. The baseline solution is a shortest path without traffic information</li><li>visited_nodes: dictionary that maps from the tuple (n, t) to a pytorch tensor with shape (I, V, T_sim+1), which contains the sequence of nodes in the road network visited by each vehicle.</li></ul><p>V is the number of vehicles in each fleet</p><ul><li>road_graph: network of roads in format networkx</li><li>edge_time_to_index: dictionary that maps the tuple (edge, time_index) to the index of the decision variable relative to the edge taken at time time_index</li><li>node_time_to_index: dictionary that maps the tuple (node, time_index) to the index of the decision variable relative to the node distribution at time_index</li><li>T_horizon: vector of tested control horizons</li><li>T_simulation: contains T_sim</li><li>initial_junctions: dictionary that maps the test index to the vector containing the initial node of each vehicle fleet</li><li>destinations: dictionary that maps the test index to the vector containing the destination node of each vehicle fleet</li><li>congestion_baseline: dictionary that maps each test index to a dictionary, which in turns maps the tuple (edge, time_index) to the congestion at the edge at time time_index, using the baseline solution</li><li>cost_baseline: dictionary that maps each test index to a vector containing the cost incurred by each agent along the baseline solution</li><li>N_random test: number of tests performed</li></ul><p><br></p><p><strong><u>Offline test</u></strong></p><p>The offline test is performed over 100 tests, all stored in a single file. The code is in Python and the data is in format .pkl which serializes the following data:</p><ul><li>x: pytorch vector of shape (N,I,n_x), where N is the number of tests (100), I is the number of agents (8), n_x is the number of decision variables. It contains the decision variables of each agent</li><li>dual: pytorch vector of shape (N, n_d), where n_d is the number of shared constraints. It contains the dual variables associated to each shared constraint.</li><li>residual: pytorch vector of shape (N, N_iter), where N_iter is the number of iterations of the solution algorithm. It contains the residual at each algorithm iteration, which measures the distance from the Nash equilibrium set.</li><li>cost: pytorch vector of shape (N,I), where N is the number of tests (100), I is the number of agents (8). Contains the cost incurred by each agent.</li><li>road_graph: network of roads in format networkx</li><li>edge_time_to_index: dictionary that maps the tuple (edge, time_index) to the index of the decision variable relative to the edge taken at time time_index</li><li>node_time_to_index: dictionary that maps the tuple (node, time_index) to the index of the decision variable relative to the node distribution at time_index</li><li>T_horizon: vector of tested control horizons</li><li>T_simulation: contains T_sim</li><li>initial_junctions: dictionary that maps the test index to the vector containing the initial node of each vehicle fleet</li><li>destinations: dictionary that maps the test index to the vector containing the destination node of each vehicle fleet</li><li>congestion_baseline: dictionary that maps each test index to a dictionary, which in turns maps the tuple (edge, time_index) to the congestion at the edge at time time_index, using the baseline solution</li><li>cost_baseline: dictionary that maps each test index to a vector containing the cost incurred by each agent along the baseline solution</li></ul><p><br></p>"
authors:
  - family-names: Benenati
    given-names: Emilio
    orcid: "https://orcid.org/0000-0003-4875-4760"
  - family-names: Grammatico
    given-names: Sergio
    orcid: "https://orcid.org/0000-0002-6021-2350"
title: "Data and code underlying the publication: Probabilistic Game-Theoretic Traffic Routing"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/dbbfecf5-a6a3-4077-968e-11c3681f4a93.v1
license: GPL-3.0
date-released: 2024-12-06