Path-Constrained Motion Planning for Robotics Based on Kinematic Constraints

Author(s):  
N. J. M. van Dijk ◽  
N. van de Wouw ◽  
H. Nijmeijer ◽  
W. C. M. Pancras

Common robotic tracking tasks consist of motions along predefined paths. The design of time-optimal path-constrained trajectories for robotic applications is discussed in this paper. To increase industrial applicability, the proposed method accounts for robot kinematics together with actuator velocity, acceleration and jerk limits instead of accounting for the generally more complex dynamic equations of a manipulator with actuator torque and torque-rate limits. Besides actuator constraints also constraints acting on process level are accounted for. The resulting non-convex optimization problem is solved using a cascade of genetic algorithms and Nelder-Mead’s method. Simulations performed on a Puma 560 manipulator model show that for a proper choice of the kinematic constraints results can be obtained that match the quality of those obtained using the more complex dynamic constraint approach.

Author(s):  
Kui Hu ◽  
Yunfei Dong ◽  
Dan Wu

Abstract Previous works solve the time-optimal path tracking problems considering piece-wise constant parametrization for the control input, which may lead to the discontinuous control trajectory. In this paper, a practical smooth minimum time trajectory planning approach for robot manipulators is proposed, which considers complete kinematic constraints including velocity, acceleration and jerk limits. The main contribution of this paper is that the control input is represented as the square root of a polynomial function, which reformulates the velocity and acceleration constraints into linear form and transforms the jerk constraints into the difference of convex form so that the time-optimal problem can be solved through sequential convex programming (SCP). The numerical results of a real 7-DoF manipulator show that the proposed approach can obtain very smooth velocity, acceleration and jerk trajectories with high computation efficiency.


Robotica ◽  
1997 ◽  
Vol 15 (1) ◽  
pp. 31-40 ◽  
Author(s):  
Zvi Shiller

This paper describes an interactive software system, developed at the Robotics and Automation Laboratory at UCLA to demonstrate innovative approaches to off-line robot programming and work-cell layout design. The software computes the time-optimal motions along specified paths, local optimal paths around an initial guess, and the global optimal path between given end-points. It considers the full robot dynamics, actuator constraints, on the payload acceleration or the gripping force, and any number of polygonal obstacles of any shape. The graphic displays provide a useful tool for interactive motion planning and workcell design.


2013 ◽  
Vol 467 ◽  
pp. 475-478
Author(s):  
Feng Yun Lin

This paper presents a method of time optimal path planning under kinematic, limit heat characteristics of DC motor and dynamic constrain for a 2-DOF wheeled. Firstly the shortest path is planned by using the geometric method under kinematic constraints. Then, in order to make full use of motors capacity we have the torque limits under limit heat characteristics of DC motor, finally the velocity limit and the boundary acceleration (deceleration) are determined to generate a time optimal path.


2014 ◽  
Vol 902 ◽  
pp. 262-266 ◽  
Author(s):  
Feng Yun Lin

This paper presents a time-optimal path planning scheme for a robot manipulator to track a specified geometric Cartesian trajectory. It considers actuator constraints, the full robot dynamics. In order to make full use of the motors capacity, the bound torques are determined by considering the bound of the generated heat. The velocity limit and the bound acceleration (deceleration) are determined by combining with dynamics. We utilize the phase plane analysis technique to generate the minimum time trajectory.


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

2017 ◽  
Vol 50 (1) ◽  
pp. 4929-4934 ◽  
Author(s):  
Gábor Csorvási ◽  
Ákos Nagy ◽  
István Vajk

Sign in / Sign up

Export Citation Format

Share Document