2021
DOI: 10.1109/access.2021.3109879
|View full text |Cite
|
Sign up to set email alerts
|

Multi-UAV Path Planning Based on Fusion of Sparrow Search Algorithm and Improved Bioinspired Neural Network

Abstract: Aiming at the problems of low stability of path planning, inability to avoid dynamic obstacles and long path planning for multi unmanned aerial vehicles (UAV) in mountainous environment, a path planning method for UAV was proposed based on the fusion of Sparrow Search Algorithm (SSA) and Bioinspired Neural Network (BINN). The method first scans the flight environment and smoothes the surface, then raises it to obtain the safe surface, and uses SSA to find a series of nodes with the lowest comprehensive cost on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
33
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 59 publications
(33 citation statements)
references
References 30 publications
0
33
0
Order By: Relevance
“…Calculate the fitness value of Harris hawks; Set the parameter X prey as the best position of the prey; for (each Harris hawks (X i )) do Update the initial energy E 0 and jump strength J using Equations ( 10) and (15); Update E using Equation ( 9); if (|E| ≥ 1) then // Exploration phase Update the location vector using Equations ( 11) and (22); if (|E| < 1) then // Exploitation phase if (u ≥ 0.5 and |E| ≥ 0.5) then // Soft besiege Update the location vector using Equation (13); if (u ≥ 0.5 and |E| < 0.5) then // Hard besiege Update the location vector using Equation (16); if (u < 0.5 and |E| ≥ 0.5) then // Soft besiege with progressive rapid dives Update the location vector using Equation (17); if (u < 0.5 and |E| < 0.5) then // Hard besiege with progressive rapid dives Update the location vector using Equation (20); end Update the location vector using Equation (24); end end end Initialize the starting position of the search agents using the final position obtained by the Harris Hawks optimizer;…”
Section: Algorithm 1 Schhomentioning
confidence: 99%
See 2 more Smart Citations
“…Calculate the fitness value of Harris hawks; Set the parameter X prey as the best position of the prey; for (each Harris hawks (X i )) do Update the initial energy E 0 and jump strength J using Equations ( 10) and (15); Update E using Equation ( 9); if (|E| ≥ 1) then // Exploration phase Update the location vector using Equations ( 11) and (22); if (|E| < 1) then // Exploitation phase if (u ≥ 0.5 and |E| ≥ 0.5) then // Soft besiege Update the location vector using Equation (13); if (u ≥ 0.5 and |E| < 0.5) then // Hard besiege Update the location vector using Equation (16); if (u < 0.5 and |E| ≥ 0.5) then // Soft besiege with progressive rapid dives Update the location vector using Equation (17); if (u < 0.5 and |E| < 0.5) then // Hard besiege with progressive rapid dives Update the location vector using Equation (20); end Update the location vector using Equation (24); end end end Initialize the starting position of the search agents using the final position obtained by the Harris Hawks optimizer;…”
Section: Algorithm 1 Schhomentioning
confidence: 99%
“…Step 3: calculate the prey energy according to Equation (10). If |E| < 1, perform an exploration according to Equation (11) and perform Cauchy variation according to Equation (22) for the global optimal solution produced by Equation (11). If |E| ≥ 1, enter local exploitation and judge the besiege mechanisms according to the prey energy E and the prey escape probability u.…”
Section: Path Planning Based On Improved Schhomentioning
confidence: 99%
See 1 more Smart Citation
“…The Explorer has a high energy reserve and a high fitness value, which mainly provides foraging areas and directions for followers. Followers follow the explorer with the best fitness value to find food to gain their own energy reserves and increase their fitness value [ 23 , 24 ]. Some followers may also constantly monitor the explorer, compete for food, and alert when they are aware of the danger and move quickly to safe areas to get a better location, while sparrows in the middle of the population walk randomly close to other sparrows, known as anti-predatory behavior [ 25 , 26 ].…”
Section: Sparrow Search Algorithmmentioning
confidence: 99%
“…Several studies have been proposed in this context, where 3D path planning algorithms use cubic Bezier spiral curves to satisfy the curvature constraint are presented in [12]- [14], while [15] proposes a seventh-order Bézier curve as a continuous curvature path approximation, which does not exceed the kinematic constraints of an aerial vehicle. The authors of [16] have performed a fusion between two heuristic methodologies, with the aim of solving the smooth path planning problem in a mountainous environment, for which the characteristics of B-spline curves are exploited.…”
Section: Introductionmentioning
confidence: 99%