scholarly journals Bi-Directional Adaptive A* Algorithm Toward Optimal Path Planning for Large-Scale UAV Under Multi-Constraints

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 85431-85440
Author(s):  
Xueli Wu ◽  
Lei Xu ◽  
Ran Zhen ◽  
Xiaojing Wu
2014 ◽  
Vol 568-570 ◽  
pp. 1054-1058 ◽  
Author(s):  
Qiang Hong ◽  
Mei Xiao Chen ◽  
Yan Song Deng

Based on improved A* algorithm, this paper proposes the optimal path planning of robot fish in globally known environment, so as to achieve better coordination between the robot fish by means of improving their path planning. In the known obstacle environment which is rasterized, target nodes are generated via smoothing A* algorithm. The unnecessary connection points are removed then and the path is smoothed at the turning points. That improved algorithm, in combination with distributed scroll algorithms, is applied to multi-robot path planning in an effort to optimize the path with the avoidance of collision. The experimental results on the 2D simulation platform have verified the feasibility of that method.


2012 ◽  
Vol 229-231 ◽  
pp. 2019-2024 ◽  
Author(s):  
Zhi Qiang Zhao ◽  
Zhi Hua Liu ◽  
Jia Xin Hao

In the process of ground simulation object maneuver simulation in large-scale operation simulation, an efficient path planning method based on A*algorithm is proposed. By means of introducing all kind of geography factors and security factors into heuristic function, the plan reaching method solves the problem of finding an optimal path under acquiring enemy's situation and terrain data. Experiment results show that it has effectively raised path planning speed of A* algorithm and the scheme is practical and feasible.


Robotica ◽  
2013 ◽  
Vol 32 (1) ◽  
pp. 77-95 ◽  
Author(s):  
Saeid Asadi ◽  
Vahid Azimirad ◽  
Ali Eslami ◽  
Saeid Karimian Eghbal

SUMMARYIn this paper an optimal path planning method based on a new evolutionary algorithm is presented for higher order robotic systems. It is a combination of immune system and wavelet mutation. By increasing the system's dimensions, the complexity of algorithm grows linearly. The obtained results have been compared with other optimal path producing algorithms, and its excellence in terms of optimality has been proved. Strengths of this method are simplicity in large-scale path planning, being free of most of the common deadlocks in usual method, and ability to obtain more optimized results than other similar methods. The effectiveness of this approach on simulation case studies for a three-link planar robot and 5 degrees of freedom mobile manipulators as well as an experiment for a mobile robot called K-joniour is shown.


Procedia CIRP ◽  
2021 ◽  
Vol 96 ◽  
pp. 324-329
Author(s):  
Frederik Wulle ◽  
Max Richter ◽  
Christoph Hinze ◽  
Alexander Verl

Author(s):  
Ahmed Barnawi ◽  
Prateek Chhikara ◽  
Rajkumar Tekchandani ◽  
Neeraj Kumar ◽  
Mehrez Boulares

Sign in / Sign up

Export Citation Format

Share Document