Cooperative Platoon Routing and Dispatching via Edge-Assisted Hybrid Quantum Optimization

• URL: http://arxiv.org/abs/2608.00524v1
• Date: Sat, 01 Aug 2026 08:35:27 GMT
• Title: Cooperative Platoon Routing and Dispatching via Edge-Assisted Hybrid Quantum Optimization
• Abstract summary: This paper develops an edge-assisted, closed-loop evaluation pipeline for platooning-aware vehicle routing.<n>Roadside units estimate local traffic kinematics from video, classify segment-level flow stability, and activate platooning rewards only on road segments where close-gap coordination is physically appropriate.<n>We evaluate the framework using a 24-hour microscopic SUMO simulation of Troy, NY, together with localized IBM Quantum hardware benchmarks.
• Score: 1.856334276134661
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Cooperative platooning can reduce the energy use of Connected and Autonomous Vehicle (CAV) fleets, but the routing problem becomes difficult when vehicles must meet on the same road segments at compatible times while moving through unstable urban traffic. This paper develops an edge-assisted, closed-loop evaluation pipeline for platooning-aware vehicle routing. Roadside Units estimate local traffic kinematics from video, classify segment-level flow stability, and activate platooning rewards only on road segments where close-gap coordination is physically appropriate. The resulting multi-vehicle routing problem is written directly as a Quadratic Unconstrained Binary Optimization (QUBO) model, so pairwise platooning interactions are represented as native quadratic Ising terms instead of requiring auxiliary MILP linearization variables. We evaluate the framework using a 24-hour microscopic SUMO simulation of Troy, NY, together with localized IBM Quantum hardware benchmarks. The SUMO study shows an $18.5\%$ reduction in fleet tractive-energy demand relative to a non-cooperative baseline. On 25-active-qubit benchmark instances executed on $\texttt{ibm_boston}$, Linear-Chain QAOA reduces two-qubit CNOT depth by $66.7\%$ compared with dense QAOA and samples the exact classical ground state with $P_{\text{feas}} = 38.6\%$ and $P_{\text{opt}} = 14.2\%$ at $p=2$. These results suggest that edge perception and shallow quantum optimization can work together as a useful component of closed-loop CAV platoon dispatching.

Related papers

• VIPS: Vehicle-Infrastructure Cooperative Planning Benchmark via Pseudo-Simulation [50.18051979020699]
  VIPS is a benchmark for cooperative autonomous driving in V2I settings based on pseudo-simulation.<n>CoS-V2X is a cooperative planning framework based on sparse representations.
  arXiv  Detail & Related papers  (2026-09-02T11:32:52Z)
• HetRoute Heterogeneous and Cost-aware Collaborative Routing Framework for Distributed Edge MoE Inference [47.0879800334801]
  HetRoute is a heterogeneous-cost-aware collaborative routing framework for distributed edge MoE inference.<n>HetRoute reduces average inference latency by up to 59.0% and P99 latency by up to 58.0%.
  arXiv  Detail & Related papers  (2026-08-01T10:30:01Z)
• FedQML-Edge: Compact Quantum Feature Sketches for Communication-Constrained Roadside Federated Learning [1.856334276134661]
  Roadside units (RSUs) supporting connected and autonomous vehicle corridors need compact models to decide when cooperative maneuvers should be rewarded, deferred, or disabled.<n>Raw sensor streams and neural network weight checkpoints are poorly suited to bandwidth-limited, privacy-sensitive roadside learning.<n>This paper presents $textttFedQML-Edge$, a quantum feature-sketching pipeline for traffic-stability gating.
  arXiv  Detail & Related papers  (2026-07-30T19:46:44Z)
• D$^3$-Subsidy: Online and Sequential Driver Subsidy Decision-Making for Large-Scale Ride-Hailing Market [13.613354145103656]
  We introduce D$3$-Subsidy (Dynamic Driver-side Diffusion-based Subsidy), a hierarchical diffusion-based framework for deployable city-wide subsidy control.<n>We show that D$3$-Subsidy improves textttRides and textttGMV while enhancing cap compliance, and a real-world A/B test confirms significant uplift.
  arXiv  Detail & Related papers  (2026-05-19T15:55:55Z)
• Entropy Across the Bridge: Conditional-Marginal Discretization for Flow and Schrödinger Samplers [68.9946633641494]
  Flow matching and Schrdinger bridges define probability, yet their inference grids are usually or inherited from one-endpoint diffusion.<n>We derive a conditional-marginal entropy-rate objective for bridge-aware discretization, separating endpoint-conditioned bridge geometry from marginal flow evolution.<n>On EDM/CIFAR-10, the entropic time-discretization gives the best tested five-step FID (186.3 pm 4.0 versus 200.5 pm 2.9 for linear and 238.0 pm 5.3 for cosine)
  arXiv  Detail & Related papers  (2026-05-15T16:11:10Z)
• Dual-Pool Token-Budget Routing for Cost-Efficient and Reliable LLM Serving [9.457255218406333]
  Production vLLM fleets typically provision each instance for the worst-case context length.<n>In practice, 80-95% of requests are short, yet are served under configurations optimized for long contexts.<n>We propose dual-pool token-budget routing, a lightweight dispatch mechanism that partitions a homogeneous fleet into two specialized pools.
  arXiv  Detail & Related papers  (2026-04-09T10:47:20Z)
• Quantum Inspired Vehicular Network Optimization for Intelligent Decision Making in Smart Cities [2.449235776276883]
  This paper presents QIVNOM, a quantum-inspired framework that jointly optimize vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication.<n>Results show that QIVNOM reduces mean end-to-end latency to 57.3ms, approximately $20%$ lower than the best baseline.
  arXiv  Detail & Related papers  (2026-03-26T03:04:50Z)
• The Curse of Conditions: Analyzing and Improving Optimal Transport for Conditional Flow-Based Generation [56.33404393159126]
  We propose a conditional optimal transport C2OT that adds a conditional weighting term in the cost matrix when computing the optimal transport assignment.<n> Experiments demonstrate that this simple fix works with both discrete and continuous conditions in 8gaussians-to-moons, CIFAR-10, ImageNet-32x32, and ImageNet-256x256.
  arXiv  Detail & Related papers  (2025-03-13T17:59:56Z)
• Dial-a-ride problem with modular platooning and en-route transfers [0.0]
  A fleet of demand-responsive transit vehicles with such technology can serve passengers door to door or have deviate to platoon with each other to travel at lower cost. A mixed integer linear programming (MILP) model is formulated to solve this "modular dial-a-ride problem" A set of small-scale synthetic numerical experiments are tested to evaluate the optimality gap and computation time between exact solutions of the MDARP.
  arXiv  Detail & Related papers  (2022-12-01T05:29:46Z)
• FeDXL: Provable Federated Learning for Deep X-Risk Optimization [105.17383135458897]
  We tackle a novel federated learning (FL) problem for optimizing a family of X-risks, to which no existing algorithms are applicable. The challenges for designing an FL algorithm for X-risks lie in the non-decomability of the objective over multiple machines and the interdependency between different machines.
  arXiv  Detail & Related papers  (2022-10-26T00:23:36Z)
• Reinforcement Learning Based Vehicle-cell Association Algorithm for Highly Mobile Millimeter Wave Communication [53.47785498477648]
  This paper investigates the problem of vehicle-cell association in millimeter wave (mmWave) communication networks. We first formulate the user state (VU) problem as a discrete non-vehicle association optimization problem. The proposed solution achieves up to 15% gains in terms sum of user complexity and 20% reduction in VUE compared to several baseline designs.
  arXiv  Detail & Related papers  (2020-01-22T08:51:05Z)

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.