2015 International Conference on Unmanned Aircraft Systems (ICUAS) 2015
DOI: 10.1109/icuas.2015.7152275
|View full text |Cite
|
Sign up to set email alerts
|

2D path planning for UAVs in radar threatening environment using simulated annealing algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(20 citation statements)
references
References 11 publications
0
18
0
Order By: Relevance
“…This algorithm can also be used to avoid regular circular radar threats [10]. It provides satisfactory answers and results with the ability of escaping from the local minima by using capital agreement rule and the threat that proposed avoidance approach used to the excellent found answers making the threat-free path easily.…”
Section: Simulated Annealing Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…This algorithm can also be used to avoid regular circular radar threats [10]. It provides satisfactory answers and results with the ability of escaping from the local minima by using capital agreement rule and the threat that proposed avoidance approach used to the excellent found answers making the threat-free path easily.…”
Section: Simulated Annealing Algorithmmentioning
confidence: 99%
“…The purposed system is written in the Java language with a Graphical User Interface (GUI) to display the results. In paper [10], the author explains Simulated Annealing (SA) Algorithm used for optimizing the 2D path for UAVs. The paper discusses about the easy threat avoidance methods and applies it to the clarification using SA to bypass from the legitimate circular radar hazard.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…A cooling schedule is used to determine when the temperature has been sufficiently cooled from the initial value. Turker et al [57] presented a method for 2D path planning in a radar threat constrained environment using a simulated annealing algorithm. Leary et al [26] evaluated five algorithms including SA, Consensus Based Bundle Algorithm (CBBA), greedy allocation, optimal Mixed Integer Linear Programming (MILP), and suboptimal MILP.…”
Section: Fixed Targetmentioning
confidence: 99%
“…In another case, the K-means algorithm and SA algorithm were combined for problems with multiple UAVs and multiple missions under complicated constraints [ 22 ]. 2D path planning in application scenarios with radar threatening was also studied in [ 23 ], in which SA algorithm was adopted to obtain nearly optimal path in 2D constrained environment, the author also tried to solve the route planning problems for multiple UAVs by executing parallel SA algorithms in [ 24 ], and demonstrated its effectiveness.…”
Section: Introductionmentioning
confidence: 99%