2021
DOI: 10.1088/1742-6596/1941/1/012012
|View full text |Cite
|
Sign up to set email alerts
|

Multi-UAV cooperative Route planning based on decision variables and improved genetic algorithm

Abstract: In order to reduce the threat cost of multi-UAV coordination, improve the effective flight time and the mission success rate, a path planning model was designed for the effectiveness and real-time performance of multi-UAV track coordination. In this paper, based on the path planning model under the condition of non-interference, the model of minimum cost flight path of multi-UAV based on time synergy is given, and a time-sequence-space coordination model is proposed to meet the requirements of electronic jammi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…Additionally, the concept of priority is employed to resolve path conflicts by making low-priority paths wait until the high-priority paths have finished their conflicting paths. Three parameters f , g, and h constitute this algorithm's heuristic function [17]. The computation of h utilizes the Euclidean distance, while the computation of g employs the eight neighborhood search method.…”
Section: Time Window Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Additionally, the concept of priority is employed to resolve path conflicts by making low-priority paths wait until the high-priority paths have finished their conflicting paths. Three parameters f , g, and h constitute this algorithm's heuristic function [17]. The computation of h utilizes the Euclidean distance, while the computation of g employs the eight neighborhood search method.…”
Section: Time Window Methodsmentioning
confidence: 99%
“…The comprehensive heuristic function, denoted as ( ) f n , which corresponds to path node n, is the sum of the two and directs the subsequent search. Three parameters f , g , and h constitute this algorithm's heuristic function [17]. The computation of h utilizes the Euclidean distance, while the computation of g employs the eight neighborhood search method.…”
Section: ( ) G N and ( )mentioning
confidence: 99%
“…Zhang et al [59] proposed a collaborative trajectory planning model, introduced decision variables into the trajectory cost model, and then improved the Genetic Algorithm to generate a formation flight trajectory, which solved the problems of short effective flight time and low mission success rate when multiple UAVs were threatened.…”
Section: Evolutionary Algorithmmentioning
confidence: 99%
“…Using genetic algorithms to solve, while considering other factors, the optimal solution for the delivery path is obtained [9]. Researchers such as Zhang Duo used an improved genetic algorithm and a multi criteria decision-making method to solve the capacity constrained vehicle delivery problem, taking into account various goals such as carbon emissions and road risks [10].…”
Section: Introductionmentioning
confidence: 99%