arXiv:2608. 09467v1 Announce Type: cross Abstract: Unmanned aerial vehicle vision-language navigation (UAV-VLN) requires agents to translate visual observations and language instructions into reliable flight actions in complex environments.
By Boxiong Wang, Hui Kang, Geng Sun, Jiahui Li, Chao Yu, Daxin Tian
arXiv:2607. 23467v1 Announce Type: new Abstract: We study an integrated pickup-and-delivery problem on sparse, non-Euclidean networks that jointly optimizes cyclic routing, cargo flow allocation, and cross-cycle service.
By Haomiao Sun, Fang He, Congyuan Ji, Xindi Tang
arXiv:2608. 16435v1 Announce Type: new Abstract: In collection operations, accumulating payload progressively slows the vehicle, imposing a cumulative penalty on routing efficiency.
By Kabir Murjani, Abhay Sobhanan
arXiv:2605. 13221v2 Announce Type: replace Abstract: In cloud manufacturing, unmanned aerial vehicles (UAVs) can support both product collection and mobile edge computing (MEC).
By Hanwen Zhang, Dusit Niyato, Wei Zhang, Xin Lou, Malcolm Yoke Hean Low
arXiv:2606. 30680v1 Announce Type: cross Abstract: Truck-drone delivery is an emerging last-mile logistics mode combining the long-haul capacity of trucks with the flexible service capability of drones.
By Xuanyu Liu, Hui Hu, Jiao Zhao, Ziliang Wang, Zhengbing He
Unmanned aerial vehicle vision-language navigation (UAV-VLN) requires agents to translate visual observations and language instructions into reliable flight actions in complex environments. Although recent end-to-end UAV vision-language-action (UAV-VLA) policies reduce reliance on separately designed perception, planning, and control modules, their behavior-cloning objectives provide limited corrective supervision for interactive closed-loop execution.
arXiv:2608. 04590v1 Announce Type: new Abstract: The growing deployment of delay-tolerant networks (DTNs) has made store-carry-forward (SCF) communication indispensable under sparse connectivity.
By Xiao Wang, Shun-Ren Yang
arXiv:2602. 07216v2 Announce Type: replace Abstract: Neural combinatorial optimization (NCO) trains fast heuristics for routing problems, but planners often need more than a single solve: they ask which stop to drop, which transition to preserve, or which subset of stops to remove if a route is infeasible.
By Reuben Narad, L\'eonard Boussioux, Michael Wagner
arXiv:2510. 10028v2 Announce Type: replace-cross Abstract: The rapid advancement of Low-Altitude Economy Networks (LAENets) has enabled a variety of applications, including aerial surveillance, environmental sensing, and semantic data collection.
By Yang Li, Ruichen Zhang, Yinqiu Liu, Guangyuan Liu, Abbas Jamalipour, Xianbin Wang, Dong In Kim
The paper presents an end‑to‑end framework that uses constraint‑oriented hypergraphs and reinforcement learning to solve vehicle routing problems. It introduces a dynamic hyperedge reconstruction strategy for better hypergraph representation and a double‑pointer attention decoder for iterative solution generation. Experiments on benchmark datasets show that the method removes the need for complex heuristic operators while improving solution quality.
By Zhenwei Wang, Tiehua Zhang, Jing Liu, Heng Yu, Kaizhu Huang, Ruibin Bai
The paper introduces GREAT, a Graph Edge Attention Network that operates directly on edge space to handle asymmetric energy costs in the Electric Vehicle Routing Problem (EVRP). Integrated into a reinforcement learning framework, GREAT jointly optimizes routing and charging decisions, outperforming a strong HGS-based heuristic by up to 8.78% in energy savings and reducing runtime by a factor of 60. It also shows competitive performance against a custom adaptive large neighborhood search and achieves state‑of‑the‑art results on other asymmetric routing benchmarks such as TSP, CVRP, and Orienteering.
By Attila Lischka, Filip Rydin, Jiaming Wu, Morteza Haghir Chehreghani, Bal\'azs Kulcs\'ar
arXiv:2509. 23413v3 Announce Type: replace Abstract: Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model.
By Changliang Zhou, Canhong Yu, Shunyu Yao, Xi Lin, Zhenkun Wang, Yu Zhou, Qingfu Zhang