AGV Path Planning Based on Chaos Particle Swarm Optimization Algorithm

LI Kui

Packaging Engineering ›› 2018 ›› Issue (23) : 32-37.

PDF(2872 KB)
PDF(2872 KB)
Packaging Engineering ›› 2018 ›› Issue (23) : 32-37. DOI: 10.19554/j.cnki.1001-3563.2018.23.006

AGV Path Planning Based on Chaos Particle Swarm Optimization Algorithm

  • LI Kui
Author information +
History +

Abstract

The work aims to optimize the AGV routing problem of logistics. An improved chaos particle swarm optimization algorithm was proposed. The route planning model based on Bézier curve was adopted to significantly improve the length and smoothness of the AGV trajectory by adjusting the number of control points of the Bézier curve. Chaos particle swarm optimization (CPSO) algorithm was applied to optimize the control points of Bézier curves. The fitness function was introduced to assess whether the termination criteria were met. If the maximum iteration number was achieved or the optimal solution was not modified when the number of iterations was given, the CPSO algorithm was terminated. Finally, the selected control points were used to calculate the shortest and smoothest trajectory, which improved the optimization capacity of the algorithm. Bézier curve initialized by CPSO algorithm can obtain the smoother shortest path.

Cite this article

Download Citations
LI Kui. AGV Path Planning Based on Chaos Particle Swarm Optimization Algorithm[J]. Packaging Engineering. 2018(23): 32-37 https://doi.org/10.19554/j.cnki.1001-3563.2018.23.006
PDF(2872 KB)

Accesses

Citation

Detail

Sections
Recommended

/