Network-Constrained Policy Optimization for Adaptive Multi-agent Vehicle Routing

• URL: http://arxiv.org/abs/2510.26089v1
• Date: Thu, 30 Oct 2025 02:49:46 GMT
• Title: Network-Constrained Policy Optimization for Adaptive Multi-agent Vehicle Routing
• Authors: Fazel Arasteh, Arian Haghparast, Manos Papagelis,
• Abstract summary: We address dynamic vehicle routing through a multi-agent reinforcement learning (MARL) framework for coordinated, network-aware fleet navigation.<n>We first propose Adaptive Navigation (AN), a decentralized MARL model where each intersection agent provides routing guidance based on local traffic and neighborhood state.<n>To improve scalability in large networks, we further propose Hierarchical Hub-based Adaptive Navigation (HHAN), an extension of AN that assigns agents only to key intersections (hubs)<n> Experiments on synthetic grids and real urban maps (Toronto, Manhattan) show that AN reduces average travel time versus SPF and learning baselines, maintaining 100% routing success.
• Score: 1.4273866043218153
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Traffic congestion in urban road networks leads to longer trip times and higher emissions, especially during peak periods. While the Shortest Path First (SPF) algorithm is optimal for a single vehicle in a static network, it performs poorly in dynamic, multi-vehicle settings, often worsening congestion by routing all vehicles along identical paths. We address dynamic vehicle routing through a multi-agent reinforcement learning (MARL) framework for coordinated, network-aware fleet navigation. We first propose Adaptive Navigation (AN), a decentralized MARL model where each intersection agent provides routing guidance based on (i) local traffic and (ii) neighborhood state modeled using Graph Attention Networks (GAT). To improve scalability in large networks, we further propose Hierarchical Hub-based Adaptive Navigation (HHAN), an extension of AN that assigns agents only to key intersections (hubs). Vehicles are routed hub-to-hub under agent control, while SPF handles micro-routing within each hub region. For hub coordination, HHAN adopts centralized training with decentralized execution (CTDE) under the Attentive Q-Mixing (A-QMIX) framework, which aggregates asynchronous vehicle decisions via attention. Hub agents use flow-aware state features that combine local congestion and predictive dynamics for proactive routing. Experiments on synthetic grids and real urban maps (Toronto, Manhattan) show that AN reduces average travel time versus SPF and learning baselines, maintaining 100% routing success. HHAN scales to networks with hundreds of intersections, achieving up to 15.9% improvement under heavy traffic. These findings highlight the potential of network-constrained MARL for scalable, coordinated, and congestion-aware routing in intelligent transportation systems.

Related papers

• An LLM-Powered Cooperative Framework for Large-Scale Multi-Vehicle Navigation [10.549493962440804]
  Multi-vehicle dynamic navigation requires simultaneously routing large fleets under evolving traffic conditions.<n>Existing path search algorithms and reinforcement learning methods struggle to scale to city-wide networks.<n>We propose CityNav, a hierarchical, LLM-powered framework for large-scale multi-vehicle navigation.
  arXiv  Detail & Related papers  (2025-10-09T06:14:29Z)
• Neighbor-Aware Reinforcement Learning for Mixed Traffic Optimization in Large-scale Networks [1.9413548770753521]
  This paper proposes a reinforcement learning framework for coordinating mixed traffic across interconnected intersections.<n>Our key contribution is a neighbor-aware reward mechanism that enables RVs to maintain balanced distribution across the network.<n>Results show that our method reduces average waiting times by 39.2% compared to the state-of-the-art single-intersection control policy.
  arXiv  Detail & Related papers  (2024-12-17T07:35:56Z)
• Improving Traffic Flow Predictions with SGCN-LSTM: A Hybrid Model for Spatial and Temporal Dependencies [55.2480439325792]
  This paper introduces the Signal-Enhanced Graph Convolutional Network Long Short Term Memory (SGCN-LSTM) model for predicting traffic speeds across road networks. Experiments on the PEMS-BAY road network traffic dataset demonstrate the SGCN-LSTM model's effectiveness.
  arXiv  Detail & Related papers  (2024-11-01T00:37:00Z)
• Towards Multi-agent Reinforcement Learning based Traffic Signal Control through Spatio-temporal Hypergraphs [19.107744041461316]
  Traffic signal systems (TSCSs) are integral to intelligent traffic management fostering efficient vehicle flow.<n>We propose a novel TSCS framework to realize intelligent traffic edge network.<n>We have crafted a multi-agent soft actor-critic (MA-SAC) reinforcement learning algorithm.
  arXiv  Detail & Related papers  (2024-04-17T02:46:18Z)
• Adaptive Hierarchical SpatioTemporal Network for Traffic Forecasting [70.66710698485745]
  We propose an Adaptive Hierarchical SpatioTemporal Network (AHSTN) to promote traffic forecasting. AHSTN exploits the spatial hierarchy and modeling multi-scale spatial correlations. Experiments on two real-world datasets show that AHSTN achieves better performance over several strong baselines.
  arXiv  Detail & Related papers  (2023-06-15T14:50:27Z)
• DenseLight: Efficient Control for Large-scale Traffic Signals with Dense Feedback [109.84667902348498]
  Traffic Signal Control (TSC) aims to reduce the average travel time of vehicles in a road network. Most prior TSC methods leverage deep reinforcement learning to search for a control policy. We propose DenseLight, a novel RL-based TSC method that employs an unbiased reward function to provide dense feedback on policy effectiveness.
  arXiv  Detail & Related papers  (2023-06-13T05:58:57Z)
• Road Network Guided Fine-Grained Urban Traffic Flow Inference [108.64631590347352]
  Accurate inference of fine-grained traffic flow from coarse-grained one is an emerging yet crucial problem. We propose a novel Road-Aware Traffic Flow Magnifier (RATFM) that exploits the prior knowledge of road networks. Our method can generate high-quality fine-grained traffic flow maps.
  arXiv  Detail & Related papers  (2021-09-29T07:51:49Z)
• 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)
• Autonomous Navigation through intersections with Graph ConvolutionalNetworks and Conditional Imitation Learning for Self-driving Cars [10.080958939027363]
  In autonomous driving, navigation through unsignaled intersections is a challenging task. We propose a novel branched network G-CIL for the navigation policy learning. Our end-to-end trainable neural network outperforms the baselines with higher success rate and shorter navigation time.
  arXiv  Detail & Related papers  (2021-02-01T07:33:12Z)
• Multi-Agent Routing Value Iteration Network [88.38796921838203]
  We propose a graph neural network based model that is able to perform multi-agent routing based on learned value in a sparsely connected graph. We show that our model trained with only two agents on graphs with a maximum of 25 nodes can easily generalize to situations with more agents and/or nodes.
  arXiv  Detail & Related papers  (2020-07-09T22:16:45Z)

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.