Feasibility-Preserving Reinforcement Learning for Dynamic Heterogeneous Multi-UAV Task Allocation with Temporal Dependencies

Coordinating heterogeneous unmanned aerial vehicles (UAVs) requires allocating complementary capabilities to temporally dependent tasks. We study a dynamic allocation model in which the dependency structure is known in advance and all other task information is revealed on arrival. The proposed framework combines a graph-transformer policy trained with proximal policy optimization, action masking, and ordered commitment to support structurally admissible allocation decisions. On a 229-scene benchmark, the method achieves higher mean recognized and Oracle-relative completion than the compared implementations, with lower completion variability across three seeds than MAPPO, and remains competitive from 12 to 40 UAVs. Within a separate ablation configuration, removing masking or ordered commitment produces the largest completion decreases. These results compare the reported configurations combining learned allocation with local structural and capacity checks.

Authors

Institutions

Publication Details

Journal
Drones
Published
2026-11-04
DOI
https://doi.org/10.3390/drones10110826
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Feasibility-Preserving Reinforcement Learning for Dynamic Heterogeneous Multi-UAV Task Allocation with Temporal Dependencies

Bangbang Ren, Тао Чен, Zumin Wan, Ruobin Li
Drones
Reinforcement Learning in Robotics
article

Feasibility-Preserving Reinforcement Learning for Dynamic Heterogeneous Multi-UAV Task Allocation with Temporal Dependencies

Bangbang Ren, Тао Чен, Zumin Wan, Ruobin Li
article en

Abstract

Coordinating heterogeneous unmanned aerial vehicles (UAVs) requires allocating complementary capabilities to temporally dependent tasks. We study a dynamic allocation model in which the dependency structure is known in advance and all other task information is revealed on arrival. The proposed framework combines a graph-transformer policy trained with proximal policy optimization, action masking, and ordered commitment to support structurally admissible allocation decisions. On a 229-scene benchmark, the method achieves higher mean recognized and Oracle-relative completion than the compared implementations, with lower completion variability across three seeds than MAPPO, and remains competitive from 12 to 40 UAVs. Within a separate ablation configuration, removing masking or ordered commitment produces the largest completion decreases. These results compare the reported configurations combining learned allocation with local structural and capacity checks.

DronesVol. 10(11)
National University of Defense Technology (CN)
Openalex Percentile: Top 16%
Reinforcement Learning in Robotics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon