Modeling,Analysis And Optimization Of Robot Welding Job State Space

In the context of my country's transformation and upgrading of the manufacturing industry,the country needs to develop industrial robot technology to improve production efficiency.This subject aims to give a general and extensive research on welding robots from the theoretical height of geometric graph theory,relying on the combination of graph theory and manifold to perform trajectory planning welding operations,and realize intelligent welding.In this paper,the welding robot is selected as the research object,and the trajectory of the working space and the moving space in the welding process is planned to achieve optimization.The main research results of this article are as follows:(1)The analysis of robot welding work space demonstrates that the welding position,welding seam and moving path form a differential manifold,and based on the Hausdorff separable feature of the manifold,the robot welding work space is decomposed into working space and moving space.According to the fact that the elements of the moving space are all empty strokes,the empty stroke coding rules are given and the optimization model of the moving space aimed at improving the welding efficiency is established.(2)The weighted undirected graph of the welding manifold is established,and the TSP model and the local short-path optimization model of the full-path optimization of the empty stroke of the welding operation are obtained.Using graph theory algorithm,it solves the problem of two different types of empty travel path optimization,and realizes the optimization of empty travel path based on graph theory.(3)Combined with the content of welding position,moving path and its optimization,combined with the characteristics of a wide number of welding industrial robots,using Solid Works software for modeling and simulation,using the offline programming software designed by the MFC software framework of VS2010 software Realize the application of wide number robot welding programming.