mlsanityData to 7 Oct 2026

DL-DRL: A double-level deep reinforcement learning approach for large-scale task scheduling of multi-UAV

arXiv 2208.02447 ↗First posted 4 Aug 2022cs.LG cs.RO eess.SPcited by 9

Not on the map. Why?

Abstract (arXiv)

Exploiting unmanned aerial vehicles (UAVs) to execute tasks is gaining growing popularity recently. To solve the underlying task scheduling problem, the deep reinforcement learning (DRL) based methods demonstrate notable advantage over the conventional heuristics as they rely less on hand-engineered rules. However, their decision space will become prohibitively huge as the problem scales up, thus deteriorating the computation efficiency. To alleviate this issue, we propose a double-level deep reinforcement learning (DL-DRL) approach based on a divide and conquer framework (DCF), where we decompose the task scheduling of multi-UAV into task allocation and route planning. Particularly, we design an encoder-decoder structured policy network in our upper-level DRL model to allocate the tasks to different UAVs, and we exploit another attention based policy network in our lower-level DRL model to construct the route for each UAV, with the objective to maximize the number of executed tasks given the maximum flight distance of the UAV. To effectively train the two models, we design an interactive training strategy (ITS), which includes pre-training, intensive training and alternate training. Experimental results show that our DL-DRL performs favorably against the learning-based and conventional baselines including the OR-Tools, in terms of solution quality and computation efficiency. We also verify the generalization performance of our approach by applying it to larger sizes of up to 1000 tasks. Moreover, we also show via an ablation study that our ITS can help achieve a balance between the performance and training efficiency.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 16 of its 49 references that are in the map. First posted on arXiv 4 Aug 2022.

Builds on

16 of 49 references.

References · 16

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  4. 2015Pointer Networkscited by 882
  5. 2018Attention, Learn to Solve Routing Problems!cited by 646
  6. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  7. 2018Data-Efficient Hierarchical Reinforcement Learningcited by 436
  8. 2016The Option-Critic Architecturecited by 433
  9. 2020Sim-to-Real Transfer in Deep Reinforcement Learning for Robotics: a Surveycited by 388
  10. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
  11. 2019A Survey of Reinforcement Learning Informed by Natural Languagecited by 154
  12. 2019Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learningcited by 78
4 more
  1. 2020Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problemcited by 31
  2. 2021Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problemcited by 31
  3. 2020A Reinforcement Learning Approach to the Orienteering Problem with Time Windowscited by 8
  4. 2022Deep Reinforcement Learning for Orienteering Problems Based on Decompositioncited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 7; 2026: 1.

9 papers.