Reference Path Generation and Obstacle Avoidance for Autonomous Vehicles Based on Waypoints, Dubins Curves and Virtual Force Field Method

AbstractObstacle avoidance is a major hurdle when implementing mobile robots and swarm robots. Swarm robots work in groups and therefore require an efficient and functional obstacle avoidance algorithm to stay collision free between themselves and their surroundings. This paper reviews previous research in obstacle avoidance implementation using the force field method (FFM), also known as potential field method (PFM) and a neutral network approach. Moreover, this paper aims to execute simulations using a modified force field algorithm and a neural network approach and compare them. The obtained results are analyzed to identify the performance characteristics and the time taken to perform tasks using a singular mobile robot against a swarm robot environment consisting of four and ten robots, respectively, in both simulation cases. Simulations showed that the algorithm was successful in navigating obstacles for both single and swarm robot environments. A single robot was found to take up to 340% longer to arrive at the required location compared to the first robot in the experiment. Moreover, it was found that the neural network approach showed ~ 27% improvement over the modified force field algorithm when it comes to cases where more than four robots are being used.

Download Full-text

Development of an Improved Rapidly Exploring Random Trees Algorithm for Static Obstacle Avoidance in Autonomous Vehicles

Sensors ◽

10.3390/s21062244 ◽

2021 ◽

Vol 21 (6) ◽

pp. 2244

Author(s):

S. M. Yang ◽

Y. A. Lin

Keyword(s):

Path Planning ◽

Obstacle Avoidance ◽

Autonomous Vehicles ◽

Autonomous Vehicle ◽

Optimal Path ◽

Random Trees ◽

Average Deviation ◽

Lane Changes ◽

Path Smoothing ◽

Rapidly Exploring Random Trees

Safe path planning for obstacle avoidance in autonomous vehicles has been developed. Based on the Rapidly Exploring Random Trees (RRT) algorithm, an improved algorithm integrating path pruning, smoothing, and optimization with geometric collision detection is shown to improve planning efficiency. Path pruning, a prerequisite to path smoothing, is performed to remove the redundant points generated by the random trees for a new path, without colliding with the obstacles. Path smoothing is performed to modify the path so that it becomes continuously differentiable with curvature implementable by the vehicle. Optimization is performed to select a “near”-optimal path of the shortest distance among the feasible paths for motion efficiency. In the experimental verification, both a pure pursuit steering controller and a proportional–integral speed controller are applied to keep an autonomous vehicle tracking the planned path predicted by the improved RRT algorithm. It is shown that the vehicle can successfully track the path efficiently and reach the destination safely, with an average tracking control deviation of 5.2% of the vehicle width. The path planning is also applied to lane changes, and the average deviation from the lane during and after lane changes remains within 8.3% of the vehicle width.

Download Full-text

Research on Multi-UAV Path Planning and Obstacle Avoidance Based on Improved Artificial Potential Field Method

2020 3rd International Conference on Mechatronics, Robotics and Automation (ICMRA) ◽

10.1109/icmra51221.2020.9398347 ◽

2020 ◽

Author(s):

Lai Dongcheng ◽

Dai Jiyang

Keyword(s):

Path Planning ◽

Obstacle Avoidance ◽

Potential Field ◽

Field Method ◽

Artificial Potential Field ◽

Potential Field Method ◽

Artificial Potential Field Method ◽

Multi Uav

Download Full-text