Multi-Type Task Assignment Algorithm for Heterogeneous UAV Cluster Based on Improved NSGA-Ⅱ

Cluster warfare, as a disruptive technology, leverages its numerical advantage to overcome limitations such as restricted task execution types and the low resilience of single platforms, embodying a significant trend in future unmanned combat. In scenarios where only the number of known targets and their vague locations within the region are available, UAV clusters are tasked with performing missions including close-range scout, target attack, and damage assessment for each target. Consequently, taking into account constraints such as assignment, payload, task time window, task sequencing, and range, a multi-objective optimization model for task assignment was formulated. Initially, optimization objectives were set as total mission completion time, total mission revenue, and cluster damage level. Subsequently, the concept of constraint tolerance was introduced to enhance the non-dominant sorting mechanism of NSGA-II by distinguishing individuals that fail to meet constraints, thereby enabling those violating constraints with high tolerance to be retained in the next generation to participate in further evolution, thereby resolving the difficulty of achieving a convergent Pareto solution set under complex interdependent task constraints. Finally, through comparisons, the superiority of the improved NSGA-II algorithm has been verified.

Authors

Institutions

Publication Details

Journal
Drones
Published
2024-08-08
DOI
https://doi.org/10.3390/drones8080384
Citations
7
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.74
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Type Task Assignment Algorithm for Heterogeneous UAV Cluster Based on Improved NSGA-Ⅱ

Yangang Liang, Hai‐Peng Ren, Yingjie Jiao, Kebo Li et al.
7 citations
Drones
Robotic Path Planning Algorithms
1.74
article

Multi-Type Task Assignment Algorithm for Heterogeneous UAV Cluster Based on Improved NSGA-Ⅱ

Yangang Liang, Hai‐Peng Ren, Yingjie Jiao, Kebo Li, Yunchong Zhu
article en
7 citations

Abstract

Cluster warfare, as a disruptive technology, leverages its numerical advantage to overcome limitations such as restricted task execution types and the low resilience of single platforms, embodying a significant trend in future unmanned combat. In scenarios where only the number of known targets and their vague locations within the region are available, UAV clusters are tasked with performing missions including close-range scout, target attack, and damage assessment for each target. Consequently, taking into account constraints such as assignment, payload, task time window, task sequencing, and range, a multi-objective optimization model for task assignment was formulated. Initially, optimization objectives were set as total mission completion time, total mission revenue, and cluster damage level. Subsequently, the concept of constraint tolerance was introduced to enhance the non-dominant sorting mechanism of NSGA-II by distinguishing individuals that fail to meet constraints, thereby enabling those violating constraints with high tolerance to be retained in the next generation to participate in further evolution, thereby resolving the difficulty of achieving a convergent Pareto solution set under complex interdependent task constraints. Finally, through comparisons, the superiority of the improved NSGA-II algorithm has been verified.

DronesVol. 8(8)
National University of Defense Technology (CN)
Openalex Percentile: Top 14%
Robotic Path Planning Algorithms
1.74
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.