Improved Particle Swarm Optimization for Laser Cutting Path Planning

Abstract

This research focuses on the long empty cutting path problem during the laser cutting process by employing an improved proximity method to establish the starting point set in complex closed graphics. Specifically, this work improves the particle swarm algorithm and proposes the Levy Flight, power function, and Singer map employed particle swarm optimization (LPSPSO) to avoid the disadvantages of the standard particle swarm optimization (PSO) algorithm. Specifically, the comprehensive prospect-regret theoretical model evaluation value is used as the fitness value to guide the algorithm's evolution and adaptively adjust the parameters in the LPSPSO algorithm, including the inertia weight power function, the learning factors, and the chaotic random number based on the Singer chaotic map. Additionally, the Levy flight is introduced to disturb the particles and prevent local optimization. This is achieved by adjusting the Levy flight threshold based on the distance between the particles to prevent the Levy flight from starting prematurely and increasing the calculation burden. To verify the performance of the LPSPSO algorithm, it was challenged against three state-of-the-art algorithms on 22 benchmark test instances and a laser cutting problem, with the results revealing that the LPSPSO algorithm has a better performance and can be used to solve the empty length of the laser cutting path problem.INDEX TERMS laser cutting path planning, improved particle swarm optimization, improved proximity method, Levy flight threshold, comprehensive prospect-regret theory, chaotic random number

Intelligent Diagnosis of Rolling Bearing Based on ICEEMDAN-WTD of Noise Reduction and Multi-Strategy Fusion Optimization SCNs

“…Fei et al [23] introduced the update strategy of the HBA mining stage to enhance the global exploration ability, and used the disturbance operator and Levy flight strategy to disturb the ability of population individuals to jump out of local areas, aiming at the problem of slow convergence speed and easy local optimization of Sparrow algorithm. Qu et al [24] used Singer mapping to generate the initial population of PSO to enhance diversity, and introduced the Levy flight method to make it obtain the ability to jump out of local areas. Hou et al [25] promoted the diversity of the grey wolf population through Tent mapping, and used the nonlinear convergence factor based on the Gaussian distribution change curve to balance the search stage.…”

Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem

“…Therefore, strategies must minimize the length of unnecessary laser head movements. This situation can also be considered an "empty trip" problem in laser cutting [11].…”

Short-Term Traffic Flow Prediction Based on VMD and IDBO-LSTM

“…It is a typical representative of chaotic mapping and is widely used for the initial population generation of metaheuristic algorithms because of its traversal and non-repetitive characteristics. Additionally, Qu and Du[28] showed that Singer mappings' traversal uniformity and convergence speed are ideal for chaotic population initialization, and they experimentally proved that SingerVOLUME 11, 2023…”