The paper introduces an AI-driven Learning-to-Optimise framework that uses Graph Neural Networks to select real‑time multi‑hop relays in NR‑V2X networks for smart cities. By modelling the vehicular network as a graph and training a GINE model with MILP‑derived optimal decisions, the method achieves near‑optimal connectivity, improving connectivity by up to 11.3% and speeding up computation by up to 100×. This enables scalable, real‑time network control suitable for Industry 4.0 and smart‑city deployments.
By Giambattista Amati, Federica Mangiatordi, Emiliano Pallotti, Simone Angelini
arXiv:2607. 14176v1 Announce Type: new Abstract: Reliable, low-latency uplink connectivity is a key requirement for C-V2X networks in dense urban environments, where fast channel variations and blockages often degrade direct vehicle-to-infrastructure links.
By Giambattista Amati, Federica Mangiatordi, Emiliano Pallotti, Simone Angelini, Pierpaolo Salvo, Paola Vocca
The paper proposes that Learning-to-Optimize (L2O) should serve as a missing architectural layer in AI-native communication networks, bridging optimisation and AI intelligence. It redefines optimisation algorithms as offline knowledge generators that produce supervisory data for neural surrogate models, enabling low‑latency inference in dynamic environments. A four‑stage workflow—optimisation, knowledge generation, surrogate learning, and runtime inference—is introduced, and demonstrated on an NR‑V2X relay‑selection problem where a Graph Neural Network learns near‑optimal decisions from MILP solutions.
By Giambattista Amati, Federica Mangiatordi, Pierpaolo Salvo, Emiliano Pallotti, Simone Angelini
arXiv:2603. 06607v2 Announce Type: replace-cross Abstract: Radio resource allocation (RRA) is a critical function in cellular vehicle-to-everything (C-V2X) networks, where vehicles must share limited wireless resources to support safety-critical communications.
By Siyuan Wang, Lei Lei, Pranav Maheshwari, Sam Bellefeuille, Kan Zheng
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.
By Alessandro Scalese, Santhanakrishnan Narayanan, Constantinos Antoniou
The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning. While Graph Neural Networks have emerged as fast, data-driven surrogates, their practical deployment is severely constrained by a spatial generalization gap.
arXiv:2607. 23734v1 Announce Type: cross Abstract: Unmanned aerial vehicles (UAVs) have emerged as a key enabler of next-generation Internet of Things (IoT) ecosystems, offering flexible aerial relaying to extend connectivity across dynamic vehicular ad hoc networks (VANETs) in smart city environments.
By Muhammad Umar Farooq Qaisar, Lin Zhang, Zhen Chen, Wajdy Othman, Shehzad Ashraf Chaudhry, Chang Liu
arXiv:2609.26275v1 Announce Type: new
Abstract: The vehicle routing problems with real-world constraints (we consider vehicles capacity limits, time windows constrains, pickup-and-delivery multi-depo...
By Andrew Soroka, Alex Meshcheryakov
arXiv:2608. 08111v1 Announce Type: cross Abstract: Vehicular Ad hoc Networks (VANETs) increasingly rely on federated learning (FL) to enable collaborative intelligence without sharing raw sensory data.
By M. Saeid HaghighiFard, Sinem Coleri
arXiv:2508. 00917v2 Announce Type: replace-cross Abstract: Connected autonomous vehicles (CAVs) must simultaneously perform multiple tasks, such as perception, prediction, planning, and control, to ensure safe and reliable navigation in complex environments.
By Jiayuan Wang, Farhad Pourpanah, Q. M. Jonathan Wu, Ning Zhang
FedPGT introduces a progressive gradient transmission scheme for vehicular federated learning over time‑varying channels, where vehicles send high‑magnitude gradient entries according to instantaneous channel conditions. The authors derive a convergence bound showing diminishing returns governed by a power‑law decay, and formulate a stochastic optimization problem that is solved via a Lyapunov drift‑plus‑penalty approach with per‑slot surrogate variables. A low‑complexity resource allocation algorithm is proposed, and experiments on CIFAR‑10 and Argoverse demonstrate a 3.65% accuracy gain and a 12.66% reduction in displacement error compared to state‑of‑the‑art baselines.
By Jintao Yan, Tan Chen, Yuxuan Sun, Sheng Zhou, Zhisheng Niu
arXiv:2608.28627v1 Announce Type: new
Abstract: Designing high-performance tactical wireless networks under realistic operational constraints gives rise to challenging combinatorial optimization prob...
By Wissem Ahmed Zaid, Alain Hertz, Defeng Liu