scholarly journals Adaptive Potential Field-Based Path Planning for Complex Autonomous Driving Scenarios

IEEE Access ◽  
2020 ◽  
pp. 1-1
Author(s):  
Bing Lu ◽  
Guofa Li ◽  
Huilong Yu ◽  
Hong Wang ◽  
Jinquan Guo ◽  
...  
2020 ◽  
Vol 17 (3) ◽  
pp. 172988141989897 ◽  
Author(s):  
Shinan Zhu ◽  
Weiyi Zhu ◽  
Xueqin Zhang ◽  
Tao Cao

Path planning of lunar robots is the guarantee that lunar robots can complete tasks safely and accurately. Aiming at the shortest path and the least energy consumption, an adaptive potential field ant colony algorithm suitable for path planning of lunar robot is proposed to solve the problems of slow convergence speed and easy to fall into local optimum of ant colony algorithm. This algorithm combines the artificial potential field method with ant colony algorithm, introduces the inducement heuristic factor, and adjusts the state transition rule of the ant colony algorithm dynamically, so that the algorithm has higher global search ability and faster convergence speed. After getting the planned path, a dynamic obstacle avoidance strategy is designed according to the predictable and unpredictable obstacles. Especially a geometric method based on moving route is used to detect the unpredictable obstacles and realize the avoidance of dynamic obstacles. The experimental results show that the improved adaptive potential field ant colony algorithm has higher global search ability and faster convergence speed. The designed obstacle avoidance strategy can effectively judge whether there will be collision and take obstacle avoidance measures.


Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7197
Author(s):  
Bing Lu ◽  
Hongwen He ◽  
Huilong Yu ◽  
Hong Wang ◽  
Guofa Li ◽  
...  

The traditional potential field-based path planning is likely to generate unexpected path by strictly following the minimum potential field, especially in the driving scenarios with multiple obstacles closely distributed. A hybrid path planning is proposed to avoid the unsatisfying path generation and to improve the performance of autonomous driving by combining the potential field with the sigmoid curve. The repulsive and attractive potential fields are redesigned by considering the safety and the feasibility. Based on the objective of the shortest path generation, the optimized trajectory is obtained to improve the vehicle stability and driving safety by considering the constraints of collision avoidance and vehicle dynamics. The effectiveness is examined by simulations in multiobstacle dynamic and static scenarios. The simulation results indicate that the proposed method shows better performance on vehicle stability and ride comfortability than that of the traditional potential field-based method in all the examined scenarios during the autonomous driving.


Energies ◽  
2019 ◽  
Vol 12 (12) ◽  
pp. 2342 ◽  
Author(s):  
Pengwei Wang ◽  
Song Gao ◽  
Liang Li ◽  
Binbin Sun ◽  
Shuo Cheng

Obstacle avoidance systems for autonomous driving vehicles have significant effects on driving safety. The performance of an obstacle avoidance system is affected by the obstacle avoidance path planning approach. To design an obstacle avoidance path planning method, firstly, by analyzing the obstacle avoidance behavior of a human driver, a safety model of obstacle avoidance is constructed. Then, based on the safety model, the artificial potential field method is improved and the repulsive field range of obstacles are rebuilt. Finally, based on the improved artificial potential field, a collision-free path for autonomous driving vehicles is generated. To verify the performance of the proposed algorithm, co-simulation and real vehicle tests are carried out. Results show that the generated path satisfies the constraints of roads, dynamics, and kinematics. The real time performance, effectiveness, and feasibility of the proposed path planning approach for obstacle avoidance scenarios are also verified.


1989 ◽  
Author(s):  
Jerome Barraquand ◽  
Bruno Langlois ◽  
Jean-Claude Latombe

2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110264
Author(s):  
Jiqing Chen ◽  
Chenzhi Tan ◽  
Rongxian Mo ◽  
Hongdu Zhang ◽  
Ganwei Cai ◽  
...  

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