Smooth path planning of ackerman chassis robot based on improved ant colony algorithm

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the domain of robotics and autonomous driving, the automatic path planning of vehicle collision-free motion is an essential task on the navigation level. It is found that the traditional path planning algorithm and the ployline path cannot fully meet the driving requirements of Ackerman chassis robot. In order to solve the autonomous navigation problem of Ackerman chassis mobile robot in structured environment, this paper presents a new improved algorithm. The method of configuration space can introduce the robot's own structural size parameters into the algorithm. Through convex polygon detection method, the local U-shaped area in the map is transformed into a closed area. The essence of these two strategies is to preprocess the map. The initial pheromone distribution is no longer globally uniform, but is distributed according to the terrain. The volatilization factor of pheromone is changed from static constant to dynamic one, which is combined with Poisson distribution law. This strategy makes the improved pheromone distribution law not only avoid the randomness and blindness in the initial stage of the algorithm, but also ensure the ant colony's exploration behavior and guiding role in the middle stage of the algorithm. Path smoothing is also a challenging task. This algorithm optimizes the path step by step by improving the evaluation function, removing redundant nodes and 2-turning algorithm. Thus, a collision free smooth path suitable for Ackerman robot is obtained. This paper combines a variety of algorithm improvement strategies, not only improving the performance of ant colony algorithm path exploration, but also planning a smooth curve path suitable rather than polyline for Ackerman mobile robot tracking. The algorithm is coded and simulated by MATLAB, and the feasibility and effectiveness of the algorithm are verified. This will provide an important basis for the subsequent algorithm migration and lay the foundation for the path tracking control of the Ackermann chassis robot.

Cite

CITATION STYLE

APA

Lei, G., & Zheng, Y. (2020). Smooth path planning of ackerman chassis robot based on improved ant colony algorithm. International Journal of Circuits, Systems and Signal Processing, 14, 361–371. https://doi.org/10.46300/9106.2020.14.49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free