Welding robot path planning problem based on discrete MOEA/D with hybrid environment selection

2021 ◽  
Author(s):  
Xin Zhou ◽  
Xuewu Wang ◽  
Xingsheng Gu
Keyword(s):  
Path Planning ◽  
Planning Problem ◽  
Welding Robot ◽  
Robot Path Planning ◽  
Path Planning Problem ◽  
Robot Path

Three Dimensional Robot Path Planning With Workspace Considerations

1992 ◽  
Author(s):  
C. Y. Liu ◽  
R. W. Mayne
Keyword(s):  
Path Planning ◽  
Three Dimensional ◽  
Optimization Methods ◽  
Planning Problem ◽  
Robot Path Planning ◽  
Recursive Quadratic Programming ◽  
Six Degree Of Freedom ◽  
Nonlinear Programming Method ◽  
Path Planning Problem ◽  
Robot Path

Abstract This paper considers the problem of robot path planning by optimization methods. It focuses on the use of recursive quadratic programming (RQP) for the optimization process and presents a formulation of the three dimensional path planning problem developed for compatibility with the RQP selling. An approach 10 distance-to-contact and interference calculations appropriate for RQP is described as well as a strategy for gradient computations which are critical to applying any efficient nonlinear programming method. Symbolic computation has been used for general six degree-of-freedom transformations of the robot links and to provide analytical derivative expressions. Example problems in path planning are presented for a simple 3-D robot. One example includes adjustments in geometry and introduces the concept of integrating 3-D path planning with geometric design.

Application of Particle Swarm Optimization to Robot Path Planning Problem

2010 ◽  
Author(s):  
Masakazu Kobayashi ◽  
Higashi Masatake
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Particle Swarm ◽  
Degree Of Freedom ◽  
Planning Problem ◽  
Robot Path Planning ◽  
Swarm Optimization ◽  
Articulated Robot ◽  
Path Planning Problem ◽  
Robot Path

A robot path planning problem is to produce a path that connects a start configuration and a goal configuration while avoiding collision with obstacles. To obtain a path for robots with high degree of freedom of motion such as an articulated robot efficiently, sampling-based algorithms such as probabilistic roadmap (PRM) and rapidly-exploring random tree (RRT) were proposed. In this paper, a new robot path planning method based on Particle Swarm Optimization (PSO), which is one of heuristic optimization methods, is proposed in order to improve efficiency of path planning for a wider range of problems. In the proposed method, a group of particles fly through a configuration space while avoiding collision with obstacles and a collection of their trajectories is regarded as a roadmap. A velocity of each particle is updated for every time step based on the update equation of PSO. After explaining the details of the proposed method, this paper shows the comparisons of efficiency between the proposed method and RRT for 2D maze problems and then shows application of the proposed method to path planning for a 6 degree of freedom articulated robot.

Sign in / Sign up

Export Citation Format

Share Document