2019
DOI: 10.3390/s19030734
|View full text |Cite
|
Sign up to set email alerts
|

Multi-UAV Reconnaissance Task Assignment for Heterogeneous Targets Based on Modified Symbiotic Organisms Search Algorithm

Abstract: This paper considers a reconnaissance task assignment problem for multiple unmanned aerial vehicles (UAVs) with different sensor capacities. A modified Multi-Objective Symbiotic Organisms Search algorithm (MOSOS) is adopted to optimize UAVs’ task sequence. A time-window based task model is built for heterogeneous targets. Then, the basic task assignment problem is formulated as a Multiple Time-Window based Dubins Travelling Salesmen Problem (MTWDTSP). Double-chain encoding rules and several criteria are establ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(19 citation statements)
references
References 31 publications
0
19
0
Order By: Relevance
“…In this paper, we choose three kinds of representative tasks, which are the reconnaissance task [30], striking task [31], and damage assessment task [32], respectively, to study the damage-tolerant task assignment algorithm. And we assume that all UAVs would take off at the base, and each UAV's departure time is determined by the moment the first task of it is assigned.…”
Section: Task Model and Uav Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, we choose three kinds of representative tasks, which are the reconnaissance task [30], striking task [31], and damage assessment task [32], respectively, to study the damage-tolerant task assignment algorithm. And we assume that all UAVs would take off at the base, and each UAV's departure time is determined by the moment the first task of it is assigned.…”
Section: Task Model and Uav Modelmentioning
confidence: 99%
“…If the overlapping assignment attempt fails, it tries the nonoverlapping mode (see line 28). If the nonoverlapping assignment attempt succeeds, task t i P would be scheduled in the nonoverlapping mode (see lines [29][30], and the backup copy of t i P would be assigned according to whether it is needed (see lines [31][32][33]; then Algorithm 1 terminates for another task (see line 34). If the task fails to be assigned in both the overlapping mode and nonoverlapping mode, the candidate UAV set would be updated to be the next top α% nearest UAVs (see line 35), and a new round assigning attempt would start.…”
Section: Assigning Algorithm For Primary Copiesmentioning
confidence: 99%
“…Paucar et al [9] deal with the use of UAVs for surveillance and reconnaissance operations in military areas and analyse the benefits of their model in the Ecuadorian Armed Forces. Chen et al [10] consider a reconnaissance task assignment problem for multiple UAVs with different sensor capacities; the authors propose a modified multi-objective symbiotic organisms search (MOSOS) algorithm to solve the problem. Wang et al [11] model UAV reconnaissance mission planning as an uncertain multi-objective orienteering problem; to solve this problem, the authors propose a discreet multi-objective bat algorithm with a local search strategy.…”
Section: Literature Reviewmentioning
confidence: 99%
“…A new odor concentration calculation function was designed in conjunction with the constraint satisfiability problem, which accelerates the problem’s convergence rate. Chen et al [ 19 ] presented a modified multi-objective symbiotic organism search algorithm for solving the reconnaissance task assignment problem for multiple UAVs with different sensor capacities. Chen et al [ 20 ] presented a modified two-part wolf pack search algorithm to solve the multi-UAV cooperative task assignment problem.…”
Section: Introductionmentioning
confidence: 99%