Distributionally Robust Chance-Constrained Task Assignment for Heterogeneous UAVs with Time Windows Under Uncertain Fuel Consumption

This paper addresses the cooperative task assignment problem for heterogeneous unmanned aerial vehicles with time windows considering uncertain fuel consumption. In the scenario where probabilistic fuel consumption exists and its distribution needs to be estimated from historical data samples, we first formulate the problem as a chance-constrained combinatorial optimization problem and utilize the sample average approximation method to solve it. Further, to address the issue of ambiguous distribution, we introduce distributionally robust chance constraints, which consider a set of probability distributions that are contained within a 1-Wasserstein ball centered around the empirical distribution of field data. We approximate the distributionally robust chance-constrained cooperative task assignment problem by applying a CVaR-based tractable approximation such that the problem can be transformed into a deterministic mixed-integer linear programming problem, which can be efficiently solved by state-of-the-art optimization solvers. Finally, we conduct a series of numerical experiments, which not only verify the computational efficiency of the distributionally robust chance-constrainted models but also reduce the degree of constraint violation in out-of-sample tests compared with a sample average approximation method.

Authors

Institutions

Publication Details

Journal
Drones
Published
2025-09-08
DOI
https://doi.org/10.3390/drones9090633
Primary Topic
Risk and Portfolio Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributionally Robust Chance-Constrained Task Assignment for Heterogeneous UAVs with Time Windows Under Uncertain Fuel Consumption

Haitao Zhong, Aoyu Zheng, Zhichao Gao, Mingfa Zheng et al.
Drones
Risk and Portfolio Optimization
article

Distributionally Robust Chance-Constrained Task Assignment for Heterogeneous UAVs with Time Windows Under Uncertain Fuel Consumption

Haitao Zhong, Aoyu Zheng, Zhichao Gao, Mingfa Zheng, Yu Mei
article en

Abstract

This paper addresses the cooperative task assignment problem for heterogeneous unmanned aerial vehicles with time windows considering uncertain fuel consumption. In the scenario where probabilistic fuel consumption exists and its distribution needs to be estimated from historical data samples, we first formulate the problem as a chance-constrained combinatorial optimization problem and utilize the sample average approximation method to solve it. Further, to address the issue of ambiguous distribution, we introduce distributionally robust chance constraints, which consider a set of probability distributions that are contained within a 1-Wasserstein ball centered around the empirical distribution of field data. We approximate the distributionally robust chance-constrained cooperative task assignment problem by applying a CVaR-based tractable approximation such that the problem can be transformed into a deterministic mixed-integer linear programming problem, which can be efficiently solved by state-of-the-art optimization solvers. Finally, we conduct a series of numerical experiments, which not only verify the computational efficiency of the distributionally robust chance-constrainted models but also reduce the degree of constraint violation in out-of-sample tests compared with a sample average approximation method.

DronesVol. 9(9)
Air Force Engineering University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 71%
Risk and Portfolio Optimization
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.