A Global Dynamic Path Planning Algorithm Based on Optimized A* Algorithm and Improved Dynamic Window Method

Author(s):  
Changwu Li ◽  
Danhong Zhang
IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 19632-19638
Author(s):  
Lisang Liu ◽  
Jinxin Yao ◽  
Dongwei He ◽  
Jian Chen ◽  
Jing Huang ◽  
...  

2011 ◽  
Vol 142 ◽  
pp. 12-15
Author(s):  
Ping Feng

The paper puts forward the dynamic path planning algorithm based on improving chaos genetic algorithm by using genetic algorithms and chaos search algorithm. In the practice of navigation, the algorithm can compute at the best path to meet the needs of the navigation in such a short period of planning time. Furthermore,this algorithm can replan a optimum path of the rest paths after the traffic condition in the sudden.


Author(s):  
H. H. Triharminto ◽  
A.S. Prabuwono ◽  
T. B. Adji ◽  
N. A. Setiawan

Most of the 3D curve path planning is used to build static path planning. For intercepting of a moving target, the path planning has to be set in a dynamic condition. L+Dumo algorithm which is based on curve is used to intercept a moving target. In the real situations, the Unmanned Aerial Vehicle (UAV) has possibility to intercept a moving target from all direction. It is assumed that environment of the UAV is in 3D Euclidean Space. It means that the UAV has to adapt for all quadrants for interception of a moving target. This research develops a path planning algorithm which enhances the previous L+Dumo algorithm to encounter the possibility quadrants. The enhancement would be simulated in C++ language to determine the accuracy of the algorithm. The simulation is conducted using one UAV and one moving target with random obstacles of cylindrical shape in between both objects. The result shows that the system accuracy is 81.0876%, a level which is able to encounter all possibility quadrants.


Sign in / Sign up

Export Citation Format

Share Document