scholarly journals Improved Bidirectional RRT ∗ Path Planning Method for Smart Vehicle

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Qingying Ge ◽  
Aijuan Li ◽  
Shaohua Li ◽  
Haiping Du ◽  
Xin Huang ◽  
...  

In this paper, an improved bidirectional RRT ∗ vehicle path planning method for smart vehicle is proposed. In this method, the resultant force of the artificial potential field is used to determine the search direction to improve the search efficiency. Different kinds of constraints are considered in the method, including the vehicle constraints and the vehicle driving environment constraints. The collision detection based on separating axis theorem is used to detect the collision between the vehicle and the obstacles to improve the planning efficiency. The cubic B-spline curve is used to optimize the path to make the path’s curvature continuous. Both simulation and experiment are implemented to verify the proposed improved bidirectional RRT ∗ method. In the simulation analysis, this paper’s method can generate the smoothest path and takes the shortest time compared with the other two methods and it can be adaptive to the complicated environment. In the real vehicle experiment, we can see from the test results that this paper’s method can be applied in practice on the smart electric vehicle platform; compared with others’ algorithm, this paper’s algorithm can generate shortest and smoothest path.

Robotica ◽  
1998 ◽  
Vol 16 (4) ◽  
pp. 415-423 ◽  
Author(s):  
Kimmo Pulakka ◽  
Veli Kujanpää

In this paper a path planning method for off-line programming of a joint robot is described. The method can automatically choose the easiest and safest route for an industrial robot from one position to another. The method is based on the use of a Self Organised Feature Map (SOFM) neural network. By using the SOFM neural network the method can adapt to different working environments of the robot. According to test results one can conclude that the SOFM neural network is a useful tool for the path planning problem of a robot.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Guo Liang Han

This paper analyzes the path planning problem in the automatic parking process, and studies a path planning method for automatic parking. The grid method and the ant colony optimization are combined to find the shortest path from the parking start point to the end point. The grid method is used to model the parking environment to simulate the actual parking space of automatic parking; then this paper makes some improvements to the basic ant colony optimization, finds the destination by setting the ants’ movement rules in the grid, and finds the shortest path after N iterations; since the optimal path found is a polyline, it will increase the difficulty of controlling vehicle path tracking and affect the accuracy of vehicle path tracking. The bezier curve is used to generate a smooth path suitable for vehicle walking. Finally, through matlab simulation, the obstacles in the environment are simulated, and the parking trajectory is obtained. The results show that the path planning method proposed in this paper is feasible.


Author(s):  
Maojia P. Li ◽  
Michael E. Kuhl ◽  
Rashmi Ballamajalu ◽  
Clark Hochgraf ◽  
Raymond Ptucha ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document