Implementation of time-optimal smooth and collision-free path planning in a two robot arm environment

Author(s):  
B. Cao ◽  
G.I. Dodds ◽  
G.W. Irwin
Robotica ◽  
1996 ◽  
Vol 14 (1) ◽  
pp. 61-70 ◽  
Author(s):  
Bailin Cao ◽  
Gordon I. Dodds ◽  
George W. Irwin

SummaryAn approach to time-optimal smooth and collision-free path planning for two industrial robot arms is presented, where path planning and joint trajectory generation are integrated. A suitable objective function, combining the requirements of time optimality and path smoothness, is proposed, which is subject to the continuity of joint trajectories, limits on their rates of change and collision-free constraints. Fast and effective collision detection for the arms is achieved using the Kuhn- Tucker conditions along with the convexity of the distance function and relying on geometrical relationships between cylinders. Nonlinear optimization is used to solve this path planning problem. The feasibility of this method is illustrated both by simulation and by experimental results.


Robotica ◽  
1986 ◽  
Vol 4 (2) ◽  
pp. 107-116 ◽  
Author(s):  
Evgeny Krustev ◽  
Ljubomir Lilov

SUMMARYPath planning of the end effector motion is here treated from the viewpoint of the path invariance under the transformations of its parametrical representation. Thus, a new method for path planning of the robot arm motion is being developed. Both the problems of finding the end effector time optimal motion and the end effector motion with a prescribed velocity profile along a preplanned path are being solved by the employment of this method. Simulation results are presented and some aspects of implementation are also discussed.


Procedia CIRP ◽  
2021 ◽  
Vol 96 ◽  
pp. 324-329
Author(s):  
Frederik Wulle ◽  
Max Richter ◽  
Christoph Hinze ◽  
Alexander Verl

Author(s):  
Jie Zhong ◽  
Tao Wang ◽  
Lianglun Cheng

AbstractIn actual welding scenarios, an effective path planner is needed to find a collision-free path in the configuration space for the welding manipulator with obstacles around. However, as a state-of-the-art method, the sampling-based planner only satisfies the probability completeness and its computational complexity is sensitive with state dimension. In this paper, we propose a path planner for welding manipulators based on deep reinforcement learning for solving path planning problems in high-dimensional continuous state and action spaces. Compared with the sampling-based method, it is more robust and is less sensitive with state dimension. In detail, to improve the learning efficiency, we introduce the inverse kinematics module to provide prior knowledge while a gain module is also designed to avoid the local optimal policy, we integrate them into the training algorithm. To evaluate our proposed planning algorithm in multiple dimensions, we conducted multiple sets of path planning experiments for welding manipulators. The results show that our method not only improves the convergence performance but also is superior in terms of optimality and robustness of planning compared with most other planning algorithms.


Author(s):  
E. Sandgren ◽  
S. Venkataraman

Abstract A design optimization approach to robot path planning in a two dimensional workplace is presented. Obstacles are represented as a series of rectangular regions and collision detection is performed by an operation similar to clipping in computer graphics. The feasible design space is approximated by a discrete set of robot arm and gripper positions. Control is applied directly through the angular motion of each link. Feasible positions which are located between the initial and final robot link positions are grouped into stages. A dynamic programming algorithm is applied to locate the best state within each stage which minimizes the overall path length. An example is presented involving a three link planar manipulator. Extensions to three dimensional robot path planning and real time control in a dynamically changing workplace are discussed.


Author(s):  
Duane W. Storti ◽  
Debasish Dutta

Abstract We consider the path planning problem for a spherical object moving through a three-dimensional environment composed of spherical obstacles. Given a starting point and a terminal or target point, we wish to determine a collision free path from start to target for the moving sphere. We define an interference index to count the number of configuration space obstacles whose surfaces interfere simultaneously. In this paper, we present algorithms for navigating the sphere when the interference index is ≤ 2. While a global calculation is necessary to characterize the environment as a whole, only local knowledge is needed for path construction.


Sign in / Sign up

Export Citation Format

Share Document