Improved Research on Target Unreachable Problem of Path Planning Based on Artificial Potential Field for an Unmanned Aerial Vehicle

2021 ◽  
Author(s):  
Zhao Liangbo ◽  
Zhu Guangsheng ◽  
Zhuang Ling ◽  
Jia Pinghui
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicle ◽  
Potential Field ◽  
Artificial Potential Field ◽  
Aerial Vehicle

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.

scholarly journals A Study on Path Planning Algorithms of UAV Collision Avoidance

2019 ◽  
Vol 37 (1) ◽  
pp. 100-106
Author(s):  
Zhao Xu ◽  
Jinwen Hu ◽  
Yunhong Ma ◽  
Man Wang ◽  
Chunhui Zhao
Keyword(s):  
Path Planning ◽  
Collision Avoidance ◽  
Potential Field ◽  
Ant Colony Algorithm ◽  
Artificial Potential Field ◽  
Fuzzy Logic Algorithm ◽  
Aerial Vehicle ◽  
Simulation Results ◽  
Planning Algorithms ◽  
Dynamic Obstacle

The unmanned aerial vehicle (UAV) has been a research hotspot worldwide. The UAV system is developing to be more and more intelligent and autonomous. UAV path planning is an important part of UAV autonomous control and the important guarantee of UAV's safety. For the purpose of improving the collision avoidance and path planning algorithms, the artificial potential field, fuzzy logic algorithm and ant colony algorithm are simulated respectively in the static obstacle and dynamic obstacle environments, and compared based on the minimum avoidance distance and range ratio. Meanwhile, an improved algorithm of artificial potential field is proposed, and the improvement helps the UAV escape the local minimum by introducing the vertical guidance repulsion. The simulation results are rigorous and reliable, which lay a foundation for the further fusion of multiple algorithms and improving the path planning algorithms.

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.

scholarly journals Path Planning Method With Improved Artificial Potential Field—A Reinforcement Learning Perspective

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 135513-135523
Author(s):  
Qingfeng Yao ◽  
Zeyu Zheng ◽  
Liang Qi ◽  
Haitao Yuan ◽  
Xiwang Guo ◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Path Planning ◽  
Potential Field ◽  
Planning Method ◽  
Artificial Potential Field

scholarly journals Improved Artificial Potential Field and Dynamic Window Method for Amphibious Robot Fish Path Planning

2021 ◽  
Vol 11 (5) ◽  
pp. 2114
Author(s):  
Wenlin Yang ◽  
Peng Wu ◽  
Xiaoqi Zhou ◽  
Haoliang Lv ◽  
Xiaokai Liu ◽  
...  
Keyword(s):  
Path Planning ◽  
Potential Field ◽  
Local Minimum ◽  
Field Method ◽  
Artificial Potential Field ◽  
Evaluation Function ◽  
Potential Field Method ◽  
Robot Fish ◽  
Amphibious Robot ◽  
Artificial Potential Field Method

Aiming at the problems of “local minimum” and “unreachable target” existing in the traditional artificial potential field method in path planning, an improved artificial potential field method was proposed after analyzing the fundamental causes of the above problems. The method solved the problem of local minimum by modifying the direction and influence range of the gravitational field, increasing the virtual target and evaluation function, and the problem of unreachable targets is solved by increasing gravity. In view of the change of motion state of robot fish in amphibious environments, the improved artificial potential field method was fused with a dynamic window algorithm, and a dynamic window evaluation function of the optimal path was designed on the basis of establishing the dynamic equations of land and underwater. Then, the simulation experiment was designed under the environment of Matlab2019a. Firstly, the improved and traditional artificial potential field methods were compared. The results showed that the improved artificial potential field method could solve the above two problems well, shorten the operation time and path length, and have high efficiency. Secondly, the influence of different motion modes on path planning is verified, and the result also reflects that the amphibious robot can avoid obstacles flexibly and reach the target point accurately according to its own motion ability. This paper provides a new way of path planning for the amphibious robot.

Sign in / Sign up

Export Citation Format

Share Document