Minimum-Time Path Planning for Unmanned Aerial Vehicles in Steady Uniform Winds

2009 ◽  
Vol 32 (6) ◽  
pp. 1736-1746 ◽  
Author(s):  
Laszlo Techy ◽  
Craig A. Woolsey
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Minimum Time ◽  
Time Path ◽  
Aerial Vehicles

Cooperative Path Planning of Unmanned Aerial Vehicles

2010 ◽  
Author(s):  
Antonios Tsourdos ◽  
Brian White ◽  
Madhavan Shanmugavel
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Aerial Vehicles

Optimal path planning with modified A-Star algorithm for stealth unmanned aerial vehicles in 3D network radar environment

2021 ◽  
pp. 095441002110073
Author(s):  
Zhe Zhang ◽  
Jian Wu ◽  
Jiyang Dai ◽  
Cheng He
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Optimal Path ◽  
Radar System ◽  
Planning Method ◽  
Optimal Path Planning ◽  
Aerial Vehicles ◽  
3D Network ◽  
Planning Scheme ◽  
Estimation Function

For stealth unmanned aerial vehicles (UAVs), path security and search efficiency of penetration paths are the two most important factors in performing missions. This article investigates an optimal penetration path planning method that simultaneously considers the principles of kinematics, the dynamic radar cross-section of stealth UAVs, and the network radar system. By introducing the radar threat estimation function and a 3D bidirectional sector multilayer variable step search strategy into the conventional A-Star algorithm, a modified A-Star algorithm was proposed which aims to satisfy waypoint accuracy and the algorithm searching efficiency. Next, using the proposed penetration path planning method, new waypoints were selected simultaneously which satisfy the attitude angle constraints and rank-K fusion criterion of the radar system. Furthermore, for comparative analysis of different algorithms, the conventional A-Star algorithm, bidirectional multilayer A-Star algorithm, and modified A-Star algorithm were utilized to settle the penetration path problem that UAVs experience under various threat scenarios. Finally, the simulation results indicate that the paths obtained by employing the modified algorithm have optimal path costs and higher safety in a 3D complex network radar environment, which show the effectiveness of the proposed path planning scheme.

scholarly journals Enhanced Particle Swarm Optimization for Path Planning of Unmanned Aerial Vehicles

2020 ◽  
Vol 14 (1) ◽  
pp. 67-78
Author(s):  
Kai Yit Kok ◽  
Parvathy Rajendran
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Aerial Vehicles ◽  
Trial And Error Method ◽  
The Impact ◽  
Enhanced Particle Swarm Optimization ◽  
Error Method

This paper presents an enhanced particle swarm optimization (PSO) for the path planning of unmanned aerial vehicles (UAVs). An evolutionary algorithm such as PSO is costly because every application requires different parameter settings to maximize the performance of the analyzed parameters. People generally use the trial-and-error method or refer to the recommended setting from general problems. The former is time consuming, while the latter is usually not the optimum setting for various specific applications. Hence, this study focuses on analyzing the impact of input parameters on the PSO performance in UAV path planning using various complex terrain maps with adequate repetitions to solve the tuning issue. Results show that inertial weight parameter is insignificant, and a 1.4 acceleration coefficient is optimum for UAV path planning. In addition, the population size between 40 and 60 seems to be the optimum setting based on the case studies.

Sign in / Sign up

Export Citation Format

Share Document