scholarly journals An Improved Artificial Potential Field for Unmanned Aerial Vehicles Path Planning

2017 ◽  
Author(s):  
Lei WANG ◽  
Bing-jie LI ◽  
Zhong-hai YIN ◽  
Cheng ZHOU ◽  
Xin ZHAO ◽  
...  
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Potential Field ◽  
Artificial Potential Field ◽  
Aerial Vehicles

Optimized artificial potential field algorithm to multi-unmanned aerial vehicle coordinated trajectory planning and collision avoidance in three-dimensional environment

2019 ◽  
Vol 233 (16) ◽  
pp. 6032-6043 ◽  
Author(s):  
Jun Tang ◽  
Jiayi Sun ◽  
Cong Lu ◽  
Songyang Lao
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Collision Avoidance ◽  
Unmanned Aerial Vehicle ◽  
Trajectory Planning ◽  
Potential Field ◽  
Three Dimensional ◽  
Artificial Potential Field ◽  
Aerial Vehicles ◽  
Aerial Vehicle ◽  
Vehicle Trajectory

Multi-unmanned aerial vehicle trajectory planning is one of the most complex global optimum problems in multi-unmanned aerial vehicle coordinated control. Results of recent research works on trajectory planning reveal persisting theoretical and practical problems. To mitigate them, this paper proposes a novel optimized artificial potential field algorithm for multi-unmanned aerial vehicle operations in a three-dimensional dynamic space. For all purposes, this study considers the unmanned aerial vehicles and obstacles as spheres and cylinders with negative electricity, respectively, while the targets are considered spheres with positive electricity. However, the conventional artificial potential field algorithm is restricted to a single unmanned aerial vehicle trajectory planning in two-dimensional space and usually fails to ensure collision avoidance. To deal with this challenge, we propose a method with a distance factor and jump strategy to resolve common problems such as unreachable targets and ensure that the unmanned aerial vehicle does not collide into the obstacles. The method takes companion unmanned aerial vehicles as the dynamic obstacles to realize collaborative trajectory planning. Besides, the method solves jitter problems using the dynamic step adjustment method and climb strategy. It is validated in quantitative test simulation models and reasonable results are generated for a three-dimensional simulated urban environment.

Obstacle avoidance in V-shape formation flight of multiple fixed-wing UAVs using variable repulsive circles

2020 ◽  
Vol 124 (1282) ◽  
pp. 1979-2000
Author(s):  
A. Mirzaee Kahagh ◽  
F. Pazooki ◽  
S. Etemadi Haghighi
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Obstacle Avoidance ◽  
Potential Field ◽  
Formation Control ◽  
Functional Limitations ◽  
Formation Flight ◽  
Artificial Potential Field ◽  
Aerial Vehicles ◽  
Shape Formation ◽  
Vector Approach

ABSTRACTA formation control and obstacle avoidance algorithm has been introduced in this paper for the V-shape formation flight of fixed-wing UAVs (Unmanned Aerial Vehicles) using the potential functions method. An innovative vector approach has been suggested to fix the conventional challenge in employing the artificial potential field (APF) approach (the creation of local minimums). A method called variable repulsive circles (VRC) has been then presented aimed at designing proper flight paths tailored with functional limitations of fixed-wing UAVs in facing obstacles. Finally, the efficiency of the designed algorithm has been examined and evaluated for different flight scenarios.

scholarly journals A New Dynamic Path Planning Approach for Unmanned Aerial Vehicles

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-17 ◽  
Author(s):  
Chenxi Huang ◽  
Yisha Lan ◽  
Yuchen Liu ◽  
Wen Zhou ◽  
Hongbin Pei ◽  
...  
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Artificial Potential Field ◽  
Aerial Vehicles ◽  
Dynamic Path Planning ◽  
Planning Approach ◽  
Starting Point ◽  
Moving Direction ◽  
Dynamic Path ◽  
The Cost

Dynamic path planning is one of the key procedures for unmanned aerial vehicles (UAV) to successfully fulfill the diversified missions. In this paper, we propose a new algorithm for path planning based on ant colony optimization (ACO) and artificial potential field. In the proposed algorithm, both dynamic threats and static obstacles are taken into account to generate an artificial field representing the environment for collision free path planning. To enhance the path searching efficiency, a coordinate transformation is applied to move the origin of the map to the starting point of the path and in line with the source-destination direction. Cost functions are established to represent the dynamically changing threats, and the cost value is considered as a scalar value of mobile threats which are vectors actually. In the process of searching for an optimal moving direction for UAV, the cost values of path, mobile threats, and total cost are optimized using ant optimization algorithm. The experimental results demonstrated the performance of the new proposed algorithm, which showed that a smoother planning path with the lowest cost for UAVs can be obtained through our algorithm.

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

scholarly journals Research on path planning of three-neighbor search A* algorithm combined with artificial potential field

2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110264
Author(s):  
Jiqing Chen ◽  
Chenzhi Tan ◽  
Rongxian Mo ◽  
Hongdu Zhang ◽  
Ganwei Cai ◽  
...  
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Obstacle Avoidance ◽  
Potential Field ◽  
Path Length ◽  
Search Time ◽  
Experimental Results ◽  
Artificial Potential Field ◽  
A Algorithm ◽  
Neighbor Search

Among the shortcomings of the A* algorithm, for example, there are many search nodes in path planning, and the calculation time is long. This article proposes a three-neighbor search A* algorithm combined with artificial potential fields to optimize the path planning problem of mobile robots. The algorithm integrates and improves the partial artificial potential field and the A* algorithm to address irregular obstacles in the forward direction. The artificial potential field guides the mobile robot to move forward quickly. The A* algorithm of the three-neighbor search method performs accurate obstacle avoidance. The current pose vector of the mobile robot is constructed during obstacle avoidance, the search range is narrowed to less than three neighbors, and repeated searches are avoided. In the matrix laboratory environment, grid maps with different obstacle ratios are compared with the A* algorithm. The experimental results show that the proposed improved algorithm avoids concave obstacle traps and shortens the path length, thus reducing the search time and the number of search nodes. The average path length is shortened by 5.58%, the path search time is shortened by 77.05%, and the number of path nodes is reduced by 88.85%. The experimental results fully show that the improved A* algorithm is effective and feasible and can provide optimal results.

Sign in / Sign up

Export Citation Format

Share Document