Minimum-risk decision for the uncertain multiobjective cooperative task assignment problem of heterogeneous unmanned aerial vehicles

The uncertain cooperative task assignment (CTA) problem based on uncertainty theory is a complex combinatorial optimization problem that cannot be effectively addressed using probability theory due to insufficient samples. In light of this limitation, this paper initially proposes an uncertain multiobjective CTA (UMCTA) problem, taking into account the uncertainties present in the battlefield environment. Consequently, the expected-value standard-deviation UMCTA model ( E σ -UMCTA) model, which emphasize the minimization of expected returns and stability of the objective functions, is developed. Nonetheless, this approach may yield suboptimal assignment schemes under predetermined risk levels. To address this issue, a minimum-risk model for the UMCTA problem is introduced by maximizing the belief degree that the objective functions do not exceed the predefined risk levels, and the concept of the minimum-risk efficient assignment scheme is delineated. Given the challenges in solving the minimum-risk model due to uncertain variables, two scenarios for addressing these uncertainties in the UMCTA problem are contemplated, and the minimum-risk model is transformed into a deterministic multiobjective programming problem. Subsequently, recognizing the combinational nature and complexity of the resulting deterministic multiobjective programming problem, an enhanced discrete particle swarm optimization (PSO) algorithm with non-dominated sorting is devised, where the crossover and mutation operators are employed to sustain diversity and avert premature convergence. Finally, a simulation study is conducted to substantiate the practicability of the proposed model and assess the efficacy of the designed algorithm.

Authors

Institutions

Publication Details

Journal
Engineering Applications of Artificial Intelligence
Published
2025-04-17
DOI
https://doi.org/10.1016/j.engappai.2025.110698
Primary Topic
Aerospace Engineering and Control Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Minimum-risk decision for the uncertain multiobjective cooperative task assignment problem of heterogeneous unmanned aerial vehicles

Haitao Zhong, Aoyu Zheng, Zhichao Gao, Mingfa Zheng et al.
Engineering Applications of Artificial Intelligence
Aerospace Engineering and Control Systems
article

Minimum-risk decision for the uncertain multiobjective cooperative task assignment problem of heterogeneous unmanned aerial vehicles

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

Abstract

The uncertain cooperative task assignment (CTA) problem based on uncertainty theory is a complex combinatorial optimization problem that cannot be effectively addressed using probability theory due to insufficient samples. In light of this limitation, this paper initially proposes an uncertain multiobjective CTA (UMCTA) problem, taking into account the uncertainties present in the battlefield environment. Consequently, the expected-value standard-deviation UMCTA model ( E σ -UMCTA) model, which emphasize the minimization of expected returns and stability of the objective functions, is developed. Nonetheless, this approach may yield suboptimal assignment schemes under predetermined risk levels. To address this issue, a minimum-risk model for the UMCTA problem is introduced by maximizing the belief degree that the objective functions do not exceed the predefined risk levels, and the concept of the minimum-risk efficient assignment scheme is delineated. Given the challenges in solving the minimum-risk model due to uncertain variables, two scenarios for addressing these uncertainties in the UMCTA problem are contemplated, and the minimum-risk model is transformed into a deterministic multiobjective programming problem. Subsequently, recognizing the combinational nature and complexity of the resulting deterministic multiobjective programming problem, an enhanced discrete particle swarm optimization (PSO) algorithm with non-dominated sorting is devised, where the crossover and mutation operators are employed to sustain diversity and avert premature convergence. Finally, a simulation study is conducted to substantiate the practicability of the proposed model and assess the efficacy of the designed algorithm.

Engineering Applications of Artificial IntelligenceVol. 153
Air Force Engineering University (CN)
National Natural Science Foundation of China, Natural Science Basic Research Program of Shaanxi Province
Openalex Percentile: Top 90%
Aerospace Engineering and Control Systems
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.