CN106563900A - Method for planning optimal welding track of automobile inner trims and exterior parts - Google Patents
Method for planning optimal welding track of automobile inner trims and exterior parts Download PDFInfo
- Publication number
- CN106563900A CN106563900A CN201611007215.1A CN201611007215A CN106563900A CN 106563900 A CN106563900 A CN 106563900A CN 201611007215 A CN201611007215 A CN 201611007215A CN 106563900 A CN106563900 A CN 106563900A
- Authority
- CN
- China
- Prior art keywords
- welding
- parts
- particle
- solder joint
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B23—MACHINE TOOLS; METAL-WORKING NOT OTHERWISE PROVIDED FOR
- B23K—SOLDERING OR UNSOLDERING; WELDING; CLADDING OR PLATING BY SOLDERING OR WELDING; CUTTING BY APPLYING HEAT LOCALLY, e.g. FLAME CUTTING; WORKING BY LASER BEAM
- B23K37/00—Auxiliary devices or processes, not specially adapted for a procedure covered by only one of the other main groups of this subclass
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
- B25J9/1656—Programme controls characterised by programming, planning systems for manipulators
- B25J9/1664—Programme controls characterised by programming, planning systems for manipulators characterised by motion, path, trajectory planning
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
- B25J9/1679—Programme controls characterised by the tasks executed
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Robotics (AREA)
- Physics & Mathematics (AREA)
- Optics & Photonics (AREA)
- Manipulator (AREA)
- Automobile Manufacture Line, Endless Track Vehicle, Trailer (AREA)
Abstract
本发明公开了一种汽车内外饰件最优焊接轨迹的方法,可针对不同的焊接部件对象,对焊点分布进行分析,计算得到相应的焊接轨迹。该方法包括:S1、焊接节点信息预处理步骤,S2、基于模拟退火粒子群算法的焊点次序规划步骤,S3、焊点规划信息转化为焊接机器人的运动轨迹步骤。汽车内外饰件焊接机器人需要在不同的曲面上进行加工,在进行此类加工任务时,需要进行加工的材料的焊点具有数目多,焊点的分布比较分散,以及焊接的部件零散,尺寸比较多的特点。在焊接生产线上,相同的焊接任务重复执行,焊点数目多导致焊接任务工作量大。本方法能有效的提供不同焊接部件多焊点情况下的移动距离最小的路径,具备较好的柔性和快速性。
The invention discloses a method for optimal welding tracks of interior and exterior trim parts of automobiles, which can analyze the distribution of welding spots for different welding parts objects, and calculate and obtain corresponding welding tracks. The method includes: S1, a welding node information preprocessing step, S2, a welding spot sequence planning step based on a simulated annealing particle swarm algorithm, and S3, a step of converting the welding spot planning information into a motion trajectory of a welding robot. Automobile interior and exterior trim welding robots need to process on different curved surfaces. When performing such processing tasks, the welding points of the materials that need to be processed have a large number, the distribution of the welding points is relatively scattered, and the welded parts are scattered and relatively small in size. Many features. In the welding production line, the same welding task is performed repeatedly, and the large number of welding points leads to a large workload of the welding task. The method can effectively provide the path with the smallest moving distance in the case of multiple welding spots of different welding parts, and has better flexibility and rapidity.
Description
技术领域technical field
本发明涉及焊接路径规划的技术领域,具体涉及一种汽车内外饰件最优焊接轨迹的方法。The invention relates to the technical field of welding path planning, in particular to a method for optimal welding trajectory of interior and exterior trim parts of automobiles.
背景技术Background technique
汽车内外饰件焊接机器人需要在不同的曲面上进行加工。一般来说,在进行此类加工任务时,需要进行加工的材料的焊点具有数目多,焊点的分布比较分散,以及焊接的部件零散,尺寸比较多的特点。在焊接生产线上,相同的焊接任务重复执行,焊点数目多导致焊接任务工作量大,所以对汽车内外饰件焊接任务中的焊点进行合理的规划很有必要,对提高总体的生产效率以及提升经济效益有着积极的作用。采用传统的方法基本上可以完成少数节点的焊接任务,但是对于大量节点的焊接任务,传统方法的所耗费的时间就呈指数增长,而且不一定能获得令人满意的结果。Automobile interior and exterior trim welding robots need to process on different curved surfaces. Generally speaking, when performing such processing tasks, the material to be processed has a large number of solder joints, scattered distribution of solder joints, and scattered welded parts with a large number of sizes. In the welding production line, the same welding task is repeatedly performed, and the large number of welding points leads to a large workload of welding tasks. Therefore, it is necessary to plan reasonably the welding points in the welding tasks of automotive interior and exterior trims, which is very important for improving overall production efficiency and It has a positive effect on improving economic efficiency. The traditional method can basically complete the welding task of a small number of nodes, but for the welding task of a large number of nodes, the time consumed by the traditional method increases exponentially, and satisfactory results may not be obtained.
基本粒子群算法的本质是利用种群中每个粒子自身迭代过程中的最优解pbest以及全部过程中找到的最优解gbest两个信息来计算该粒子下一次迭代之后的位置,基本粒子群算法在迭代初期的收敛速度非常快。但是经过了若干次迭代后,种群的粒子便会趋于统一,失去了多样性,使得算法的收敛速度变慢,进而造成早熟现象。The essence of the basic particle swarm optimization algorithm is to use the optimal solution pbest in the iteration process of each particle in the population and the optimal solution gbest found in the whole process to calculate the position of the particle after the next iteration. The basic particle swarm optimization algorithm The convergence speed in the early stage of iteration is very fast. However, after several iterations, the particles of the population will tend to be unified and lose their diversity, which will slow down the convergence speed of the algorithm and cause premature phenomenon.
模拟退火算法基于实际的物理过程的思想来得到的一种启发式算法。当金属物体被加热到一定温度之后,随着温度的逐步降低,该物体的分子就会就会以一定的概率处于不同的状态。模拟退火的思想最早是有Metropolis提出,之后成功应用于组合优化问题之中。算法的主要思想是,首先生成一个初始解作为当前解,然后在当前解的邻域开始按照一定的规则跳转,选择按照一定的当前温度T的函数作为概率来跳转到非局部最优解,从而使得算法有能力跳出局部最优解。然后将跳转到的解作为当前解持续重复这个过程。随着T的减小,跳转到非局部最优解的概率也随之降低,当T趋于0的时候,算法将会收敛到全局最优解。The simulated annealing algorithm is a heuristic algorithm based on the idea of the actual physical process. When a metal object is heated to a certain temperature, as the temperature gradually decreases, the molecules of the object will be in different states with a certain probability. The idea of simulated annealing was first proposed by Metropolis, and then successfully applied to combinatorial optimization problems. The main idea of the algorithm is to first generate an initial solution as the current solution, and then start jumping according to certain rules in the neighborhood of the current solution, and select a function according to a certain current temperature T as the probability to jump to the non-local optimal solution , so that the algorithm has the ability to jump out of the local optimal solution. Then continue to repeat the process with the jump to solution as the current solution. As T decreases, the probability of jumping to a non-local optimal solution also decreases. When T tends to 0, the algorithm will converge to the global optimal solution.
发明内容Contents of the invention
本发明的目的是为了解决现有技术中的上述缺陷,提供一种汽车内外饰件最优焊接轨迹的方法。The purpose of the present invention is to solve the above-mentioned defects in the prior art, and provide a method for optimal welding trajectory of interior and exterior trim parts of automobiles.
本发明的目的可以通过采取如下技术方案达到:The purpose of the present invention can be achieved by taking the following technical solutions:
一种汽车内外饰件最优焊接轨迹的方法,所述方法包括:A method for an optimal welding track of an interior and exterior trim of an automobile, the method comprising:
S1、焊接节点预处理步骤,对所需要的焊接的部件使用图像处理的方式,并与预先设定的焊点信息C=(C1,C2,......,CN)比较,其中有N个焊接节点,依次为C1,C2,......,CN;S1. Welding node preprocessing step, using image processing method for the required welding parts, and comparing with the preset welding point information C=(C 1 , C 2 ,...,C N ) , where there are N welding nodes, which are C 1 , C 2 ,...,C N ;
S2、焊点次序规划步骤,在获得焊接任务的焊点信息C之后,使用模拟退火粒子群算法,将焊接任务的焊点信息C作为输入的数据进行计算,经过算法的迭代运算之后,得到满足要求的一条焊接轨迹;S2. The welding point sequence planning step. After obtaining the welding point information C of the welding task, use the simulated annealing particle swarm algorithm to calculate the welding point information C of the welding task as the input data. After the iterative operation of the algorithm, it is satisfied A welding track required;
S3、焊点规划信息转化为焊接机器人的运动轨迹步骤,对于求取到的满足要求的焊接轨迹,直接用于焊接机器人内外饰件焊接过程中,使其对需要焊接的节点依次焊接。S3. The step of transforming the welding point planning information into the motion trajectory of the welding robot. The obtained welding trajectory that meets the requirements is directly used in the welding process of the welding robot's interior and exterior trim parts, so that it can weld the nodes that need to be welded sequentially.
进一步地,所述步骤S2具体包括:Further, the step S2 specifically includes:
S21、根据模拟退火粒子群算法,设置粒子群的大小为n,初始温度为T,终值时间为T_MIN,退火速率为r,每个粒子采用随机选择一个节点,再选取剩余节点中的最近节点,直到遍历全部节点为止的方法,构成初始粒子群{θ1,θ2,θ3......θn},以初始化的θ1,θ2,θ3......θn作为每个粒子自身迭代过程中的最优解pbest,再根据当前的全部pbesti取长度最短的值作为初始的全部过程中找到的最优解gbest;S21. According to the simulated annealing particle swarm algorithm, set the size of the particle swarm to n, the initial temperature to T, the final value time to T_MIN, and the annealing rate to r, each particle randomly selects a node, and then selects the nearest node among the remaining nodes , until all nodes are traversed, the initial particle group {θ 1 ,θ 2 ,θ 3 ......θ n } is formed, and the initialized θ 1 ,θ 2 ,θ 3 ......θ n is used as the optimal solution pbest in the iterative process of each particle itself, and then the value with the shortest length is taken according to all current pbest i as the optimal solution gbest found in the entire initial process;
S22、针对每个粒子的当前路径θi,按照逆转方法来产生新的遍历路径,并计算相应的模拟退火概率,按照设定重复L次,得到模拟退火优化路径,并将此路径与pbesti进行比较,更新每个粒子的pbesti以及gbest;S22. For the current path θ i of each particle, generate a new traversal path according to the reverse method, and calculate the corresponding simulated annealing probability, repeat L times according to the setting, obtain the simulated annealing optimization path, and compare this path with pbest i Compare and update pbest i and gbest of each particle;
S23、将当前路径θi分别与更新后的pbesti和gbest进行交叉,得到新一代的当前路径{θ1,θ2,θ3......θn},将当前温度T乘以退火系数r,以此来更新温度,再判断是否满足退出条件,若不满足退出条件,则返回步骤S22;若满足退出条件,则返回此时的gbest和f(gbest)并退出运算,并返回此时计算出的最好的焊点次序θbest。S23. Intersect the current path θ i with the updated pbest i and gbest respectively to obtain a new generation of current paths {θ 1 , θ 2 , θ 3 ... θ n }, and multiply the current temperature T by The annealing coefficient r is used to update the temperature, and then judge whether the exit condition is met. If the exit condition is not met, return to step S22; if the exit condition is met, return gbest and f(gbest) at this time and exit the operation, and return The best solder spot sequence θ best calculated at this time.
进一步地,所述步骤S22中针对每个粒子的当前路径θi,按照逆转中间或者两端的方法来产生新的遍历路径。Further, in the step S22, for the current path θ i of each particle, a new traversal path is generated by reversing the middle or both ends.
进一步地,所述退出条件为达到预定的迭代次数或达到退火温度。Further, the exit condition is reaching a predetermined number of iterations or reaching an annealing temperature.
进一步地,所述步骤S1具体包括:Further, the step S1 specifically includes:
S11、确定工件中各个部件是否具有正确的焊点数目和位置;S11. Determine whether each component in the workpiece has the correct number and position of solder joints;
S12、识别出工件中所包含的所有部件后,将信息传输到机械臂,调用正确的焊头对部件进行焊接。S12. After identifying all the parts contained in the workpiece, the information is transmitted to the mechanical arm, and the correct welding head is called to weld the parts.
进一步地,所述步骤S11中通过图像处理算法检测焊点数目和位置。Further, in the step S11, the number and position of solder joints are detected by an image processing algorithm.
进一步地,所述步骤S3中将所述焊点次序θbest作为焊接机器人的焊接轨迹的节点,从而使其自动地依次对焊点进行焊接操作。Further, in the step S3, the welding point sequence θ best is used as a node of the welding trajectory of the welding robot, so that it automatically performs welding operations on the welding points in sequence.
本发明相对于现有技术具有如下的优点及效果:Compared with the prior art, the present invention has the following advantages and effects:
1、本发明在焊接生产线上应用算法来计算不同部件的焊接轨迹,实现焊接生产线的柔性化。1. The present invention applies an algorithm on the welding production line to calculate the welding trajectories of different components, so as to realize the flexibility of the welding production line.
2、本发明将智能算法应用于焊接路径规划之中,能够快速有效地求取满足要求的有序路径,提高了生产效率。2. The present invention applies an intelligent algorithm to welding path planning, which can quickly and effectively obtain an ordered path that meets requirements, and improves production efficiency.
3、本发明采用自动控制的方式自动地对汽车内外饰件进行焊接操作,降低了操作难度,能产生可观的经济效益。3. The present invention adopts an automatic control method to automatically perform welding operations on the interior and exterior trim parts of automobiles, which reduces the difficulty of operation and can produce considerable economic benefits.
附图说明Description of drawings
图1是本发明公开的一种汽车内外饰件最优焊接轨迹的方法流程图;Fig. 1 is a kind of method flow chart of the optimal welding trajectory of automobile interior and exterior parts disclosed by the present invention;
图2是本发明公开的一种汽车内外饰件最优焊接轨迹的方法在具体实施方式中的焊点示意图;Fig. 2 is a schematic diagram of solder joints in a specific embodiment of a method for optimal welding trajectory of an automobile interior and exterior trim disclosed by the present invention;
图3是本发明公开的一种汽车内外饰件最优焊接轨迹的方法在具体实施方式中的结果图;Fig. 3 is a result diagram in a specific embodiment of a method for an optimal welding trajectory of an automobile interior and exterior trim disclosed by the present invention;
图4是本发明公开的一种汽车内外饰件最优焊接轨迹的方法在具体实施方式中的算法迭代结果图。Fig. 4 is an algorithm iteration result diagram in a specific embodiment of a method for an optimal welding trajectory of an interior and exterior trim of an automobile disclosed by the present invention.
具体实施方式detailed description
为使本发明实施例的目的、技术方案和优点更加清楚,下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.
实施例一Embodiment one
本实施例公开了一种汽车内外饰件最优焊接轨迹的方法,该方法可针对不同的焊接部件对象,对焊点分布进行分析,计算得到相应的焊接轨迹。流程图如图1所示,该方法具体包括下列步骤:This embodiment discloses a method for optimal welding trajectory of interior and exterior trim parts of automobiles. The method can analyze the distribution of welding spots for different welding parts objects, and calculate the corresponding welding trajectory. The flow chart is shown in Figure 1, and the method specifically includes the following steps:
S1、焊接节点预处理步骤,对所需要的焊接的部件使用图像处理的方式,并与预先设定的焊点信息C=(C1,C2,......,CN)比较,其中有N个焊接节点,依次为C1,C2,......,CN。S1. Welding node preprocessing step, using image processing method for the required welding parts, and comparing with the preset welding point information C=(C 1 , C 2 ,...,C N ) , where there are N welding nodes, which are C 1 , C 2 ,...,C N .
具体应用中,所述步骤S1具体包括:In a specific application, the step S1 specifically includes:
S11、在工件需要焊接之前,需要首先确定工件中各个部件是否具有正确的焊点数目和位置,通过图像处理算法,可以检测出部件是否具有正确的焊点;S11. Before the workpiece needs to be welded, it is necessary to first determine whether each component in the workpiece has the correct number and position of solder joints. Through the image processing algorithm, it can be detected whether the component has the correct solder joints;
S12、识别出工件中所包含的所有部件后,就可以将信息传输到机械臂,从而调用正确的焊头对部件进行焊接。S12. After identifying all the parts contained in the workpiece, the information can be transmitted to the robot arm, so as to call the correct welding head to weld the parts.
S2、焊点次序规划步骤,在获得焊接任务的焊点信息C之后,使用模拟退火粒子群算法,将焊接任务焊点信息C作为输入的数据进行计算,经过算法的迭代运算之后,得到满足要求的一条焊接轨迹。S2. The solder joint sequence planning step. After obtaining the solder joint information C of the welding task, the simulated annealing particle swarm algorithm is used to calculate the solder joint information C of the welding task as the input data. After the iterative operation of the algorithm, the requirements are obtained. a welding trajectory.
具体应用中,所述步骤S2具体包括:In a specific application, the step S2 specifically includes:
S21、根据模拟退火粒子群算法,设置粒子群的大小为n,初始温度为T,终值时间为T_MIN,退火速率为r。每个粒子采用随机选择一个节点,再选取剩余节点中的最近节点,直到遍历全部节点为止的方法,构成初始粒子群{θ1,θ2,θ3......θn}。再以初始化的θ1,θ2,θ3......θn作为每个粒子自身迭代过程中的最优解pbest,再根据当前的全部pbesti取长度最短的值作为初始的全部过程中找到的最优解gbest。S21. According to the simulated annealing particle swarm algorithm, set the size of the particle swarm to be n, the initial temperature to be T, the final value time to be T_MIN, and the annealing rate to be r. Each particle adopts the method of randomly selecting a node, and then selecting the nearest node among the remaining nodes until all nodes are traversed to form an initial particle group {θ 1 ,θ 2 ,θ 3 ......θ n }. Then take the initialized θ 1 , θ 2 , θ 3 ... θ n as the optimal solution pbest in the iterative process of each particle itself, and then take the value with the shortest length according to all the current pbest i as the initial total The optimal solution gbest found in the process.
S22、针对每个粒子的当前路径θi,按照逆转中间或者两端的方法来产生新的遍历路径,并计算相应的模拟退火概率,按照设定重复L次,得到模拟退火优化路径,并将此路径与pbesti进行比较,更新每个粒子的pbesti以及gbest。S22. For the current path θ i of each particle, a new traversal path is generated by reversing the middle or both ends, and the corresponding simulated annealing probability is calculated, and repeated L times according to the setting, to obtain the simulated annealing optimization path, and calculate the corresponding simulated annealing probability. The path is compared with pbest i , updating pbest i and gbest for each particle.
S23、将当前路径θi分别与更新后的pbesti和gbest进行交叉,得到新一代的当前路径{θ1,θ2,θ3......θn}。将当前温度T乘以退火系数r,以此来更新温度。再判断是否满足退出条件,若不满足退出条件,则返回步骤S22;若满足退出条件,则返回此时的gbest和f(gbest)并退出运算,并返回此时计算出的最好的焊点次序θbest。S23. Intersect the current path θ i with the updated pbest i and gbest respectively to obtain a new generation of current paths {θ 1 , θ 2 , θ 3 ... θ n }. The temperature is updated by multiplying the current temperature T by the annealing coefficient r. Then judge whether to meet the exit condition, if not meet the exit condition, then return to step S22; if meet the exit condition, then return gbest and f(gbest) at this time and exit the calculation, and return the best solder point calculated at this time Order θ best .
其中,所述退出条件为达到预定的迭代次数或达到退火温度。Wherein, the exit condition is reaching a predetermined number of iterations or reaching an annealing temperature.
S3、焊点规划信息转化为焊接机器人的运动轨迹步骤,对于求取到的满足要求的焊接轨迹,直接用于焊接机器人内外饰件焊接过程中,使其对需要焊接的节点依次焊接,完成了全部需要焊接的节点之后则完成本次任务。整体流程图如图1所示。S3. The welding point planning information is converted into the motion trajectory step of the welding robot. The obtained welding trajectory that meets the requirements is directly used in the welding process of the welding robot's internal and external trim parts, so that it can weld the nodes that need to be welded sequentially, and the completion is completed. After all the nodes that need to be welded, complete this task. The overall flow chart is shown in Figure 1.
具体应用中,该步骤将智能算法得到的θbest作为焊接机器人的焊接轨迹的节点,从而使其自动地依次对焊点进行焊接操作,从而快速地完成依次汽车内外饰件焊接的过程。In the specific application, this step uses the θ best obtained by the intelligent algorithm as the node of the welding trajectory of the welding robot, so that it can automatically perform welding operations on the welding points in sequence, thereby quickly completing the process of sequentially welding the interior and exterior parts of the car.
实施例二Embodiment two
本实施例具体公开了一种汽车内外饰件最优轨迹焊接的方法,能够对针对不同的焊接部件对象,对焊点分布进行分析,计算得到相应的焊接轨迹。流程图如图1所示,具体步骤如下所示:This embodiment specifically discloses a method for optimal trajectory welding of interior and exterior trim parts of automobiles, which can analyze the distribution of welding spots for different welding parts objects, and calculate the corresponding welding trajectory. The flow chart is shown in Figure 1, and the specific steps are as follows:
S1、焊接节点预处理步骤,由生产工艺得到焊点信息的表示,并与实际传输到焊接工位的部件进行比较,满足条件则说明部件无误,可以进行实际的焊接工作。本实施方式的焊接节点如图2所示。S1. Welding joint preprocessing step, the representation of welding joint information is obtained from the production process, and compared with the parts actually transmitted to the welding station. If the conditions are met, it means that the parts are correct and the actual welding work can be carried out. The welding node of this embodiment is shown in FIG. 2 .
S2、焊点次序规划步骤,在获得焊接任务焊点信息C之后,使用模拟退火粒子群算法,将C作为输入的数据进行计算,经过算法的迭代运算之后,得到满足要求的一条焊接轨迹;S2, the welding spot sequence planning step, after obtaining the welding task welding spot information C, use the simulated annealing particle swarm algorithm to calculate C as the input data, and after the iterative calculation of the algorithm, obtain a welding trajectory that meets the requirements;
S21、根据模拟退火粒子群算法,设置粒子群的大小为200,初始温度为10000,终值时间为1,退火速率为0.99。每个粒子采用随机选择一个节点,再选取剩余节点中的最近节点,直到遍历全部节点为止的方法,构成初始粒子群{θ1,θ2,θ3......θn}。再以初始化的θ1,θ2,θ3......θn作为每个粒子的pbesti,再根据当前的全部pbesti取长度最短的值作为初始的gbest。S21. According to the simulated annealing particle swarm algorithm, set the size of the particle swarm to 200, the initial temperature to 10000, the final value time to 1, and the annealing rate to 0.99. Each particle adopts the method of randomly selecting a node, and then selecting the nearest node among the remaining nodes until all nodes are traversed to form an initial particle group {θ 1 ,θ 2 ,θ 3 ......θ n }. Then take the initialized θ 1 , θ 2 , θ 3 ... θ n as the pbest i of each particle, and then take the value with the shortest length according to all the current pbest i as the initial gbest.
S22、针对每个粒子的当前路径θi,按照逆转中间或者两端的方法来产生新的遍历路径,并计算相应的模拟退火概率,按照设定重复30次,得到模拟退火优化路径,并将此路径与pbesti进行比较,更新每个粒子的pbesti以及gbest。S22. For the current path θ i of each particle, a new traversal path is generated by reversing the middle or both ends, and the corresponding simulated annealing probability is calculated, and repeated 30 times according to the setting, to obtain the simulated annealing optimization path, and calculate the corresponding simulated annealing probability. The path is compared with pbest i , updating pbest i and gbest for each particle.
S23、将当前路径θi分别与更新后的pbesti和gbest进行交叉,得到新一代的当前路径{θ1,θ2,θ3......θn}。将当前温度T乘以退火系数r,以此来更新温度。再判断是否满足退出条件,若不满足退出条件,则返回第二步;若满足退出条件,则返回此时的gbest和f(gbest)并退出运算,并返回此时计算出的最好的焊点次序θbest。计算得到的效果如图3所示,算法迭代次数的效果如图4所示。S23. Intersect the current path θ i with the updated pbest i and gbest respectively to obtain a new generation of current paths {θ 1 , θ 2 , θ 3 ... θ n }. The temperature is updated by multiplying the current temperature T by the annealing coefficient r. Then judge whether the exit condition is satisfied, if the exit condition is not satisfied, then return to the second step; if the exit condition is satisfied, then return gbest and f(gbest) at this time and exit the operation, and return the best weld calculated at this time Point order θ best . The calculated effect is shown in Figure 3, and the effect of the number of algorithm iterations is shown in Figure 4.
S3、焊点规划信息转化为焊接机器人的运动轨迹步骤,对于求取到的一组满足要求的焊接轨迹,直接用于焊接机器人内外饰件焊接过程中,使其对需要焊接的节点依次焊接,完成了全部需要焊接的节点之后则完成本次任务。S3. The welding point planning information is transformed into the motion trajectory step of the welding robot. For a set of welding trajectory that meets the requirements obtained, it is directly used in the welding process of the welding robot's internal and external trim parts, so that it can weld the nodes that need to be welded sequentially. After completing all the nodes that need to be welded, the task is completed.
综上所述,本发明中采用的模拟退火粒子群算法结合了模拟退火算法跳出局部最优的优点以及粒子群算法简易并且具备全局搜索能力的优点,将改进的模拟退火粒子群算法应用与焊接轨迹规划中。In summary, the simulated annealing particle swarm algorithm adopted in the present invention combines the advantages of the simulated annealing algorithm jumping out of the local optimum and the advantages of the particle swarm algorithm being simple and capable of global search, and the improved simulated annealing particle swarm algorithm is applied to the welding trajectory planning.
上述实施例为本发明较佳的实施方式,但本发明的实施方式并不受上述实施例的限制,其他的任何未背离本发明的精神实质与原理下所作的改变、修饰、替代、组合、简化,均应为等效的置换方式,都包含在本发明的保护范围之内。The above-mentioned embodiment is a preferred embodiment of the present invention, but the embodiment of the present invention is not limited by the above-mentioned embodiment, and any other changes, modifications, substitutions, combinations, Simplifications should be equivalent replacement methods, and all are included in the protection scope of the present invention.
Claims (7)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611007215.1A CN106563900B (en) | 2016-11-16 | 2016-11-16 | A method of obtaining the optimal welding track of inner and outer decorative parts of automobile |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611007215.1A CN106563900B (en) | 2016-11-16 | 2016-11-16 | A method of obtaining the optimal welding track of inner and outer decorative parts of automobile |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106563900A true CN106563900A (en) | 2017-04-19 |
| CN106563900B CN106563900B (en) | 2018-09-14 |
Family
ID=58542029
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611007215.1A Expired - Fee Related CN106563900B (en) | 2016-11-16 | 2016-11-16 | A method of obtaining the optimal welding track of inner and outer decorative parts of automobile |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106563900B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107350667A (en) * | 2017-06-23 | 2017-11-17 | 华南理工大学 | A kind of emulation mode of the automobile door plate welding flexible production line based on digital factory |
| CN107390684A (en) * | 2017-07-14 | 2017-11-24 | 华南理工大学 | A kind of auto-parts welding optimum path planning method of multirobot collaboration |
| CN107972032A (en) * | 2017-11-13 | 2018-05-01 | 广东工业大学 | A kind of control method and device of articulated arm robots |
| CN108297105A (en) * | 2018-01-17 | 2018-07-20 | 广东工业大学 | A kind of mechanical arm task level time optimal trajectory planning method |
| CN108544495A (en) * | 2018-06-19 | 2018-09-18 | 广东工业大学 | A kind of path of welding planing method, system and the equipment of more welding robots |
| CN109514552A (en) * | 2018-11-14 | 2019-03-26 | 华南理工大学 | A kind of method of the identification of automobile door plate solder joint and path of welding planning |
| CN110440822A (en) * | 2019-08-12 | 2019-11-12 | 中国科学院长春光学精密机械与物理研究所 | Based on slime mould-ant colony blending algorithm automobile solder joint path planing method |
| CN112388148A (en) * | 2020-09-25 | 2021-02-23 | 广州瑞松智能科技股份有限公司 | Simulated annealing algorithm-based welding parameter optimization method |
| WO2021109050A1 (en) * | 2019-12-05 | 2021-06-10 | 惠州光弘科技股份有限公司 | Smt solder joint quality control method and system based on particle swarm optimization |
| CN118357928A (en) * | 2024-06-18 | 2024-07-19 | 佛山隆深机器人有限公司 | A dishwasher component welding method based on a robotic arm and related device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001087876A (en) * | 1999-09-21 | 2001-04-03 | Amada Co Ltd | Method for forming moving route in ultra high-speed laser machining and device therefor, and storage medium storing program of method for forming of moving route in ultra high-speed laser machining |
| JP2001195112A (en) * | 2000-01-12 | 2001-07-19 | Sumitomo Heavy Ind Ltd | Method for determining laser drilling route |
| US20080125893A1 (en) * | 2006-10-31 | 2008-05-29 | Gm Global Technology Operations, Inc. | Apparatus and Method of Automated Manufacturing |
| CN102023611A (en) * | 2010-12-02 | 2011-04-20 | 广东工业大学 | Seeking route plan optimizing method of laser cutting machine |
| CN105033520A (en) * | 2015-08-05 | 2015-11-11 | 柳州职业技术学院 | Multi-welding robot cooperative control system for improving particle swarm algorithm |
-
2016
- 2016-11-16 CN CN201611007215.1A patent/CN106563900B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001087876A (en) * | 1999-09-21 | 2001-04-03 | Amada Co Ltd | Method for forming moving route in ultra high-speed laser machining and device therefor, and storage medium storing program of method for forming of moving route in ultra high-speed laser machining |
| JP2001195112A (en) * | 2000-01-12 | 2001-07-19 | Sumitomo Heavy Ind Ltd | Method for determining laser drilling route |
| US20080125893A1 (en) * | 2006-10-31 | 2008-05-29 | Gm Global Technology Operations, Inc. | Apparatus and Method of Automated Manufacturing |
| CN102023611A (en) * | 2010-12-02 | 2011-04-20 | 广东工业大学 | Seeking route plan optimizing method of laser cutting machine |
| CN105033520A (en) * | 2015-08-05 | 2015-11-11 | 柳州职业技术学院 | Multi-welding robot cooperative control system for improving particle swarm algorithm |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107350667A (en) * | 2017-06-23 | 2017-11-17 | 华南理工大学 | A kind of emulation mode of the automobile door plate welding flexible production line based on digital factory |
| CN107390684B (en) * | 2017-07-14 | 2019-10-18 | 华南理工大学 | A multi-robot collaborative optimal path planning method for auto parts welding |
| CN107390684A (en) * | 2017-07-14 | 2017-11-24 | 华南理工大学 | A kind of auto-parts welding optimum path planning method of multirobot collaboration |
| CN107972032A (en) * | 2017-11-13 | 2018-05-01 | 广东工业大学 | A kind of control method and device of articulated arm robots |
| CN108297105A (en) * | 2018-01-17 | 2018-07-20 | 广东工业大学 | A kind of mechanical arm task level time optimal trajectory planning method |
| CN108297105B (en) * | 2018-01-17 | 2021-07-06 | 广东工业大学 | A task-level time-optimal trajectory planning method for robotic arms |
| CN108544495A (en) * | 2018-06-19 | 2018-09-18 | 广东工业大学 | A kind of path of welding planing method, system and the equipment of more welding robots |
| CN108544495B (en) * | 2018-06-19 | 2021-05-11 | 广东工业大学 | Welding path planning method, system and equipment for multiple welding robots |
| CN109514552A (en) * | 2018-11-14 | 2019-03-26 | 华南理工大学 | A kind of method of the identification of automobile door plate solder joint and path of welding planning |
| CN110440822A (en) * | 2019-08-12 | 2019-11-12 | 中国科学院长春光学精密机械与物理研究所 | Based on slime mould-ant colony blending algorithm automobile solder joint path planing method |
| CN110440822B (en) * | 2019-08-12 | 2021-03-23 | 中国科学院长春光学精密机械与物理研究所 | Automobile welding spot path planning method based on slime mold-ant colony fusion algorithm |
| WO2021109050A1 (en) * | 2019-12-05 | 2021-06-10 | 惠州光弘科技股份有限公司 | Smt solder joint quality control method and system based on particle swarm optimization |
| CN112388148A (en) * | 2020-09-25 | 2021-02-23 | 广州瑞松智能科技股份有限公司 | Simulated annealing algorithm-based welding parameter optimization method |
| CN118357928A (en) * | 2024-06-18 | 2024-07-19 | 佛山隆深机器人有限公司 | A dishwasher component welding method based on a robotic arm and related device |
| CN118357928B (en) * | 2024-06-18 | 2024-10-18 | 佛山隆深机器人有限公司 | A dishwasher component welding method based on a robotic arm and related device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106563900B (en) | 2018-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106563900B (en) | A method of obtaining the optimal welding track of inner and outer decorative parts of automobile | |
| CN107390684B (en) | A multi-robot collaborative optimal path planning method for auto parts welding | |
| CN111515503B (en) | A collision-free path planning method for arc welding robot | |
| US8571706B2 (en) | Method and system for optimizing the layout of a robot work cell | |
| CN113325799B (en) | Spot welding robot operation space smooth path planning method for curved surface workpiece | |
| US9469029B2 (en) | Method and apparatus for saving energy and reducing cycle time by optimal ordering of the industrial robotic path | |
| US20100114338A1 (en) | Multi-goal path planning of welding robots with automatic sequencing | |
| CN108544495B (en) | Welding path planning method, system and equipment for multiple welding robots | |
| Erdős et al. | Process planning and offline programming for robotic remote laser welding systems | |
| EP3562629B1 (en) | Method and system for determining a sequence of kinematic chains of a multiple robot | |
| Mian et al. | Enhance performance of inspection process on Coordinate Measuring Machine | |
| CN115122338B (en) | A multi-robot collaborative arc welding task planning method based on multi-objective optimization | |
| CN110802601A (en) | Robot path planning method based on fruit fly optimization algorithm | |
| CN115167278A (en) | An optimal motion trajectory planning method for intensive point processing | |
| JP5641243B2 (en) | Work support system | |
| Wang et al. | Autonomous intelligent planning method for welding path of complex ship components | |
| Zhao et al. | Spot-welding path planning method for the curved surface workpiece of body-in-white based on a memetic algorithm | |
| Kovács | Task sequencing for remote laser welding in the automotive industry | |
| CN105867427B (en) | Diameter On-Line Control Method is sought by a kind of robot towards dynamic environment | |
| CN117840985A (en) | A robot process path planning method and system considering multiple posture angles of end effector | |
| CN114281087B (en) | Path planning method based on lifetime planning A* and speed obstacle method | |
| CN105955921A (en) | Robot hierarchical reinforcement learning initialization method based on automatic discovery of abstract action | |
| US9207667B2 (en) | Automatic generation of robotic processes for symmetric products | |
| CN114054948A (en) | Method and device for operating a laser material processing machine | |
| Alatartsev et al. | Robot trajectory optimization for the relaxed end-effector path |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180914 Termination date: 20211116 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |