Shaking Force Minimization of High-Speed Robots via Optimal Trajectory Planning

Author(s):  
S. Briot ◽  
V. Arakelian ◽  
J.-P. Le Baron
2010 ◽  
Vol 108-111 ◽  
pp. 1141-1146
Author(s):  
Jie Yan ◽  
Dao Xiong Gong

The Strength Pareto Evolutionary Algorithm (SPEA) is adopted to find time-jerk synthetic optimal trajectory of a hexapod robot in the joint space. In order to get the optimal trajectory, cubic splines are employed and derived under the constraint condition of via points to assure overall continuity of velocity and acceleration. Taken both the execution time and minimax approach of jerk as objectives, and expressed the kinematics constraints as upper bounds on the absolute values of velocity and acceleration, the mathematic model of time-jerk synthetic optimal trajectory planning is built. Finally, SPEA is adopted to optimize the stair-climbing trajectory of a hexapod robot, the simulation results show that this method can solve the trajectory planning problem effectively, and the stair-climbing trajectory can meet the contradictory objective functions of high speed and low robot vibration well.


2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Yanjie Liu ◽  
Le Liang ◽  
Haijun Han ◽  
Shijie Zhang

In this work, the energy-optimal trajectory planning and initial pick point searching problem for palletizing robot with high load capacity and high speed are studied, in which the pick point and place point of the robot are fixed to a desired location for each single task. These optimization problems have been transformed to ternary functional extremum problem and parameters optimal selection problem in which the performance index of the problems the rigid-flexible coupling dynamics model of the robot, and the constraint and boundary conditions of the robot are given. The fourth-order Runge-Kutta method, multiple shooting method, and traversing method are used to solve these specific mathematical problems. The effectiveness of the trajectory planning method is validated by the experimental and simulating results; thus the research work done here provides important support for subsequent palletizing robot research.


2021 ◽  
Vol 13 (7) ◽  
pp. 168781402110346
Author(s):  
Yunyue Zhang ◽  
Zhiyi Sun ◽  
Qianlai Sun ◽  
Yin Wang ◽  
Xiaosong Li ◽  
...  

Due to the fact that intelligent algorithms such as Particle Swarm Optimization (PSO) and Differential Evolution (DE) are susceptible to local optima and the efficiency of solving an optimal solution is low when solving the optimal trajectory, this paper uses the Sequential Quadratic Programming (SQP) algorithm for the optimal trajectory planning of a hydraulic robotic excavator. To achieve high efficiency and stationarity during the operation of the hydraulic robotic excavator, the trade-off between the time and jerk is considered. Cubic splines were used to interpolate in joint space, and the optimal time-jerk trajectory was obtained using the SQP with joint angular velocity, angular acceleration, and jerk as constraints. The optimal angle curves of each joint were obtained, and the optimal time-jerk trajectory planning of the excavator was realized. Experimental results show that the SQP method under the same weight is more efficient in solving the optimal solution and the optimal excavating trajectory is smoother, and each joint can reach the target point with smaller angular velocity, and acceleration change, which avoids the impact of each joint during operation and conserves working time. Finally, the excavator autonomous operation becomes more stable and efficient.


Sign in / Sign up

Export Citation Format

Share Document