A Path Planning Method of Logistics Robot Based on Improved Ant Colony Algorithm

Author(s):  
Ran Xu ◽  
Zhang Qi ◽  
Ge Fen
2014 ◽  
Vol 568-570 ◽  
pp. 785-788 ◽  
Author(s):  
Chang Hui Song

An improved ant colony algorithm based grid environment model for global path planning method for USV was introduced. The main idea of the improved ant colony algorithm was distributing each ant route dynamically. When the active ant was selecting the next route, this algorithm program determined the nearest direction to the end point. There were many possible route points which were distributed artificially. Thereby, the probability for each ant to choose the right direction was increased. The simulating results demonstrate that the improved ant colony algorithm in this paper is very suitable for solving the question of global path planning for USV system in the complex oceanic environment where there are a lot of obstacles. At the same time, this method costs less time, and the path is very smooth.


2020 ◽  
Vol 10 (23) ◽  
pp. 8641
Author(s):  
Xuan Ye ◽  
Lan Luo ◽  
Li Hou ◽  
Yang Duan ◽  
Yang Wu

Coverage path planning on a complex free-form surface is a representative problem that has been steadily investigated in path planning and automatic control. However, most methods do not consider many optimisation conditions and cannot deal with complex surfaces, closed surfaces, and the intersection of multiple surfaces. In this study, a novel and efficient coverage path-planning method is proposed that considers trajectory optimisation information and uses point cloud data for environmental modelling. First, the point cloud data are denoised and simplified. Then, the path points are converted into the rotation angle of each joint of the manipulator. A mathematical model dedicated to energy consumption, processing time, and path smoothness as optimisation objectives is developed, and an improved ant colony algorithm is used to solve this problem. Two measures are proposed to prevent the algorithm from being trapped in a local optimum, thereby improving the global search ability of the algorithm. The standard test results indicate that the improved algorithm performs better than the ant colony algorithm and the max–min ant system. The numerical simulation results reveal that compared with the point cloud slicing technique, the proposed method can obtain a more efficient path. The laser ablation de-rusting experiment results specify the utility of the proposed approach.


Sign in / Sign up

Export Citation Format

Share Document