2020 International Conference on Information Science, Parallel and Distributed Systems (ISPDS) 2020
DOI: 10.1109/ispds51347.2020.00062
|View full text |Cite
|
Sign up to set email alerts
|

Application of Improved Simulated Annealing Genetic Algorithm in Task Assignment of Swarm of Drones

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…In paper [21], for the task allocation problem of the urban road traffic information collection sensor network for the collaborative collection of complex traffic parameters, the sensor network is mapped to a multiagent system, and the task completion time, node energy consumption, and network load balance are used as the evaluation function. The authors used alliance-based collaborative methods to construct a nonlinear multiobjective optimization model of sensor network task allocation.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In paper [21], for the task allocation problem of the urban road traffic information collection sensor network for the collaborative collection of complex traffic parameters, the sensor network is mapped to a multiagent system, and the task completion time, node energy consumption, and network load balance are used as the evaluation function. The authors used alliance-based collaborative methods to construct a nonlinear multiobjective optimization model of sensor network task allocation.…”
Section: Related Workmentioning
confidence: 99%
“…In order to better understand the crossover process, we use formulas (20) and (21) to visualize it. We chose the crossover point at the 5 th gene sequence and swapped all sequences from then on:…”
Section: Selectionmentioning
confidence: 99%
“…At the same time, CSA can be used to solve multiobjective problems. Comparing CSA with the GA [19][20][21], the main difference is the way the population evolves. In the GA, the population evolves through crossover and mutation, and in the CSA, cell reproduction is asexual, with each offspring produced by one cell being an exact copy of its parents, and mutation and selection are made through these offspring.…”
Section: Introductionmentioning
confidence: 99%
“…[22] also uses a clustering algorithm, but in this case, it is k-means instead of CSCM. In [23], SA is used inside a GA to prevent the GA from stalling in local minima and, as a result, improves the compilation time with respect to a normal GA for the same task. Ref.…”
mentioning
confidence: 99%