Decision-Oriented Learning with Differentiable Submodular Maximization for Vehicle Routing Problem
Not on the map. Why?
Abstract (arXiv)
We study the problem of learning a function that maps context observations (input) to parameters of a submodular function (output). Our motivating case study is a specific type of vehicle routing problem, in which a team of Unmanned Ground Vehicles (UGVs) can serve as mobile charging stations to recharge a team of Unmanned Ground Vehicles (UAVs) that execute persistent monitoring tasks. {We want to learn the mapping from observations of UAV task routes and wind field to the parameters of a submodular objective function, which describes the distribution of landing positions of the UAVs .} Traditionally, such a learning problem is solved independently as a prediction phase without considering the downstream task optimization phase. However, the loss function used in prediction may be misaligned with our final goal, i.e., a good routing decision. Good performance in the isolated prediction phase does not necessarily lead to good decisions in the downstream routing task. In this paper, we propose a framework that incorporates task optimization as a differentiable layer in the prediction phase. Our framework allows end-to-end training of the prediction model without using engineered intermediate loss that is targeted only at the prediction performance. In the proposed framework, task optimization (submodular maximization) is made differentiable by introducing stochastic perturbations into deterministic algorithms (i.e., stochastic smoothing). We demonstrate the efficacy of the proposed framework using synthetic data. Experimental results of the mobile charging station routing problem show that the proposed framework can result in better routing decisions, e.g. the average number of UAVs recharged increases, compared to the prediction-optimization separate approach.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 16 of its 32 references that are in the map. First posted on arXiv 2 Mar 2023.
Builds on
16 of 32 references.
References · 16
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2019Differentiable Convex Optimization Layerscited by 458
- 2017Smart "Predict, then Optimize"cited by 332
- 2019Differentiation of Blackbox Combinatorial Solverscited by 224
- 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
- 2018Differentiable MPC for End-to-end Planning and Controlcited by 178
- 2019MIPaaL: Mixed Integer Program as a Layercited by 93
- 2019Smart Predict-and-Optimize for Hard Combinatorial Optimization Problemscited by 88
- 2019Differentiable Gaussian Process Motion Planningcited by 27
- 2018Resilient Active Target Tracking with Multiple Robotscited by 10
- 2020Coverage of an Environment Using Energy-Constrained Unmanned Aerial Vehiclescited by 3
- 2021Learning-based Moving Horizon Estimation through Differentiable Convex Optimization Layerscited by 3
4 more
- 2020Energy-Constrained Delivery of Goods with Drones Under Varying Wind Conditionscited by 1
- 2021Learning Submodular Objectives for Team Environmental Monitoringcited by 1
- 2022Risk-aware UAV-UGV Rendezvous with Chance-Constrained Markov Decision Processcited by 1
- 2022Risk-aware Resource Allocation for Multiple UAVs-UGVs Recharging Rendezvouscited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.