Welding Robot Collision-Free Path Optimization
نویسندگان
چکیده
Reasonable welding path has a significant impact on welding efficiency, and a collision-free path should be considered first in the process of welding robot path planning. The shortest path length is considered as an optimization objective, and obstacle avoidance is considered as the constraint condition in this paper. First, a grid method is used as a modeling method after the optimization objective is analyzed. For local collision-free path planning, an ant colony algorithm is selected as the search strategy. Then, to overcome the shortcomings of the ant colony algorithm, a secondary optimization is presented to improve the optimization performance. Finally, the particle swarm optimization algorithm is used to realize global path planning. Simulation results show that the desired welding path can be obtained based on the optimization strategy.
منابع مشابه
Collision-free Path Planning for Remote Laser Welding
The paper proposes algorithms for collision-free path planning in robotic Remote Laser Welding (RLW), using collision detection on a triangle mesh representation of the moving objects and a path planning algorithm based on a classical A∗ search, both highly specialized to the needs of RLW. The algorithms depart from an optimized task sequence and an initial, potentially colliding rough-cut path...
متن کاملScheduling in a Multi-robot Welding System
Multi-robot systems have been introduced actively in heavy industry in order to increase the productivity. However, since the configuration of workpiece is complex and multiple robots are disposed densely in a working area, collision between adjacent robots could occur. Because the collision prevents effective production, collision occurrence should be avoided. This paper reduces the problem of...
متن کاملCoordinating the Motions of Multiple Robots with Specified Trajectories
Coordinating the motions of multiple robots operating in a shared workspace without collisions is an important capability. We address the task of coordinating the motions of multiple robots when their trajectories (defned by both the path and velocity along the path) are specijied. This problem of collision-pee trajectory coordination arises in welding and painting workcells in the automotive i...
متن کاملمسیریابی حرکت روباتهای ماشینواره با روش پیشروی سریع
The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...
متن کاملRobot Path Planning Based on Random Coding Particle Swarm Optimization
Mobile robot navigation is to find an optimal path to guide the movement of the robot, so path planning is guaranteed to find a feasible optimal path. However, the path planning problem must be solve two problems, i.e., the path must be kept away from obstacles or avoid the collision with obstacles and the length of path should be minimized. In this paper, a path planning algorithm based on ran...
متن کامل