mlsanityData to 14 Oct 2026

Multi-Start Team Orienteering Problem for UAS Mission Re-Planning with Data-Efficient Deep Reinforcement Learning

arXiv 2303.01963 ↗First posted 2 Mar 2023cs.LG cs.RO math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, we study the Multi-Start Team Orienteering Problem (MSTOP), a mission re-planning problem where vehicles are initially located away from the depot and have different amounts of fuel. We consider/assume the goal of multiple vehicles is to travel to maximize the sum of collected profits under resource (e.g., time, fuel) consumption constraints. Such re-planning problems occur in a wide range of intelligent UAS applications where changes in the mission environment force the operation of multiple vehicles to change from the original plan. To solve this problem with deep reinforcement learning (RL), we develop a policy network with self-attention on each partial tour and encoder-decoder attention between the partial tour and the remaining nodes. We propose a modified REINFORCE algorithm where the greedy rollout baseline is replaced by a local mini-batch baseline based on multiple, possibly non-duplicate sample rollouts. By drawing multiple samples per training instance, we can learn faster and obtain a stable policy gradient estimator with significantly fewer instances. The proposed training algorithm outperforms the conventional greedy rollout baseline, even when combined with the maximum entropy objective.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 44 references that are in the map. First posted on arXiv 2 Mar 2023.

Builds on

18 of 44 references.

References · 18

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2015Pointer Networkscited by 895
  4. 2018Attention, Learn to Solve Routing Problems!cited by 656
  5. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 608
  6. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
  7. 2020POMO: Policy Optimization with Multiple Optima for Reinforcement Learningcited by 348
  8. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 333
  9. 2019Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacementcited by 211
  10. 2018Understanding the impact of entropy on policy optimizationcited by 176
  11. 2021Maximum Entropy RL (Provably) Solves Some Robust RL Problemscited by 176
  12. 2020Train Large, Then Compress: Rethinking Model Size for Efficient Training and Inference of Transformerscited by 67
6 more
  1. 2020Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimizationcited by 63
  2. 2021The Transformer Network for the Traveling Salesman Problemcited by 59
  3. 2021Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problemcited by 31
  4. 2020A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problemscited by 30
  5. 2019On Learning Paradigms for the Travelling Salesman Problemcited by 24
  6. 2021Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problemscited by 13

Built on by

Not cited yet.