Path Planning for Mount Robot Based on Improved Particle Swarm Optimization Algorithm

被引:9
作者
Li, Xudong [1 ]
Tian, Bin [1 ]
Hou, Shuaidong [1 ]
Li, Xinxin [1 ]
Li, Yang [1 ]
Liu, Chong [1 ,2 ]
Li, Jingmin [1 ,2 ,3 ]
机构
[1] Dalian Univ Technol, Sch Mech Engn, Dalian 116024, Peoples R China
[2] Dalian Univ Technol, Key Lab Micro Nano Technol & Syst Liaoning Prov, Dalian 116024, Peoples R China
[3] Dalian Univ Technol, State Key Lab High Performance Precis Mfg, Dalian 116024, Peoples R China
关键词
mount robot; path planning; particle swarm optimization (PSO); adaptive strategy; PSO;
D O I
10.3390/electronics12153289
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To address the problem of cooperative work among right-angle coordinate robots in spacecraft structural plate mount tasks, an improved particle swarm optimization (PSO) algorithm was proposed to assign paths to three robots in a surface-mounted technology (SMT) machine. First, the optimization objective of path planning was established by analyzing the working process of the SMT machine. Then, the inertia weight update strategy was designed to overcome the early convergence of the traditional PSO algorithm, and the learning factor of each particle was calculated using fuzzy control to improve the global search capability. To deal with the concentration phenomenon of particles in the iterative process, the genetic algorithm (GA) was introduced when the particles were similar. The particles were divided into elite, high-quality, or low-quality particles according to their performance. New particles were generated through selection and crossover operations to maintain the particle diversity. The performance of the proposed algorithm was verified with the simulation results, which could shorten the planning path and quicken the convergence compared to the traditional PSO or GA. For large and complex maps, the proposed algorithm shortens the path by 7.49% and 11.49% compared to traditional PSO algorithms, and by 3.98% and 4.02% compared to GA.
引用
收藏
页数:17
相关论文
共 37 条
[11]   Printed Circuit Board Assembly Planning for Multi-Head Gantry SMT Machine Using Multi-Swarm and Discrete Firefly Algorithm [J].
Hsu, Hsien-Pin .
IEEE ACCESS, 2021, 9 :1642-1654
[12]   Optimizing the operation sequence of a chip placement machine using TSP model [J].
Kumar, R ;
Luo, ZH .
IEEE TRANSACTIONS ON ELECTRONICS PACKAGING MANUFACTURING, 2003, 26 (01) :14-21
[13]   An intelligence-based hybrid PSO-SA for mobile robot path planning in warehouse [J].
Lin, Shiwei ;
Liu, Ang ;
Wang, Jianguo ;
Kong, Xiaoying .
JOURNAL OF COMPUTATIONAL SCIENCE, 2023, 67
[14]   Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing - tabu search algorithm to solve the symmetrical traveling salesman problem [J].
Lin, Yu ;
Bian, Zheyong ;
Liu, Xiang .
APPLIED SOFT COMPUTING, 2016, 49 :937-952
[15]   A Study on Particle Swarm Algorithm Based on Restart Strategy and Adaptive Dynamic Mechanism [J].
Liu, Lisang ;
Xu, Hui ;
Wang, Bin ;
Zhang, Rongsheng ;
Chen, Jionghui .
ELECTRONICS, 2022, 11 (15)
[16]   Self-Tuning Control of Manipulator Positioning Based on Fuzzy PID and PSO Algorithm [J].
Liu, Ying ;
Jiang, Du ;
Yun, Juntong ;
Sun, Ying ;
Li, Cuiqiao ;
Jiang, Guozhang ;
Kong, Jianyi ;
Tao, Bo ;
Fang, Zifan .
FRONTIERS IN BIOENGINEERING AND BIOTECHNOLOGY, 2022, 9
[17]  
[陆瞳瞳 Lu Tongtong], 2017, [现代制造工程, Modern Manufacturing Engineering], P22
[18]   Optimal path planning of multi-robot in dynamic environment using hybridization of meta-heuristic algorithm [J].
Paikray, Hemanta Kumar ;
Das, Pradipta Kumar ;
Panda, Sucheta .
INTERNATIONAL JOURNAL OF INTELLIGENT ROBOTICS AND APPLICATIONS, 2022, 6 (04) :625-667
[19]  
[彭乾伟 Peng Qianwei], 2022, [重庆大学学报, Journal of Chongqing University], V45, P51
[20]  
[强宁 Qiang Ning], 2015, [陕西师范大学学报. 自然科学版, Journal of Shaanxi Normal University. Natural Science Edition], V43, P36