Laser Ablation Manipulator Coverage Path Planning Method Based on an Improved Ant Colony Algorithm

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 intersectio...

Full description

Bibliographic Details
Main Authors: Xuan Ye, Lan Luo, Li Hou, Yang Duan, Yang Wu
Format: Article
Language:English
Published: MDPI AG 2020-12-01
Series:Applied Sciences
Subjects:
Online Access:https://www.mdpi.com/2076-3417/10/23/8641
id doaj-c371247ae25248a9a02d825434e10cf9
record_format Article
spelling doaj-c371247ae25248a9a02d825434e10cf92020-12-04T00:01:12ZengMDPI AGApplied Sciences2076-34172020-12-01108641864110.3390/app10238641Laser Ablation Manipulator Coverage Path Planning Method Based on an Improved Ant Colony AlgorithmXuan Ye0Lan Luo1Li Hou2Yang Duan3Yang Wu4School of Mechanical Engineering, Sichuan University, Chengdu 610065, ChinaSchool of Mechanical & Electronical Engineering, Lanzhou University of Technology, Lanzhou 730050, ChinaSchool of Mechanical Engineering, Sichuan University, Chengdu 610065, ChinaSchool of Mechanical Engineering, Sichuan University, Chengdu 610065, ChinaSchool of Mechanical Engineering, Sichuan University, Chengdu 610065, ChinaCoverage 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.https://www.mdpi.com/2076-3417/10/23/8641coverage path planningant colony optimisationpoint cloud datalaser ablation
collection DOAJ
language English
format Article
sources DOAJ
author Xuan Ye
Lan Luo
Li Hou
Yang Duan
Yang Wu
spellingShingle Xuan Ye
Lan Luo
Li Hou
Yang Duan
Yang Wu
Laser Ablation Manipulator Coverage Path Planning Method Based on an Improved Ant Colony Algorithm
Applied Sciences
coverage path planning
ant colony optimisation
point cloud data
laser ablation
author_facet Xuan Ye
Lan Luo
Li Hou
Yang Duan
Yang Wu
author_sort Xuan Ye
title Laser Ablation Manipulator Coverage Path Planning Method Based on an Improved Ant Colony Algorithm
title_short Laser Ablation Manipulator Coverage Path Planning Method Based on an Improved Ant Colony Algorithm
title_full Laser Ablation Manipulator Coverage Path Planning Method Based on an Improved Ant Colony Algorithm
title_fullStr Laser Ablation Manipulator Coverage Path Planning Method Based on an Improved Ant Colony Algorithm
title_full_unstemmed Laser Ablation Manipulator Coverage Path Planning Method Based on an Improved Ant Colony Algorithm
title_sort laser ablation manipulator coverage path planning method based on an improved ant colony algorithm
publisher MDPI AG
series Applied Sciences
issn 2076-3417
publishDate 2020-12-01
description 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.
topic coverage path planning
ant colony optimisation
point cloud data
laser ablation
url https://www.mdpi.com/2076-3417/10/23/8641
work_keys_str_mv AT xuanye laserablationmanipulatorcoveragepathplanningmethodbasedonanimprovedantcolonyalgorithm
AT lanluo laserablationmanipulatorcoveragepathplanningmethodbasedonanimprovedantcolonyalgorithm
AT lihou laserablationmanipulatorcoveragepathplanningmethodbasedonanimprovedantcolonyalgorithm
AT yangduan laserablationmanipulatorcoveragepathplanningmethodbasedonanimprovedantcolonyalgorithm
AT yangwu laserablationmanipulatorcoveragepathplanningmethodbasedonanimprovedantcolonyalgorithm
_version_ 1724401040084697088