A* algorithm used in three-dimensional environment for optimal path planning

Author(s):  
Wu Chao-shuai ◽  
Liu Guo-rong ◽  
Zhang Wen-li ◽  
Zhang Wei
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.


2020 ◽  
Vol 152 ◽  
pp. 101644 ◽  
Author(s):  
Chinmay S. Kulkarni ◽  
Pierre F.J. Lermusiaux

2020 ◽  
Vol 309 ◽  
pp. 04006
Author(s):  
Yuheng Chen ◽  
Hongyun Wu ◽  
Qiru Sui ◽  
Yinghao Chen ◽  
Rongyao Wang ◽  
...  

Deep sea mining, as a frontier area in China, urgently needs to make progress in automatic navigation technology. In order to improve the operation efficiency of the seabed mining machine on the soft seabed, the submarine mining vehicle which complete the mining work in a certain mining area need to enter the next mining area quickly and economically. As a classical algorithm, the majority of scholars consider that A * algorithm is the most practical path planning search algorithm. Considering the limitation of operation conditions, the three-dimensional diagram is transformed into two-dimensional diagram by interpolation method when the seabed terrain conditions allow, and then the obstacles can be marked in two-dimensional diagram. A* algorithm was applied into the path planning of mining truck. The simulation results of the paper show that path cost, turning time and turning mode should be considered in the process of avoiding obstacles.


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