Robot Time-Optimal Trajectory Planning Based on Quintic Polynomial Interpolation and Improved Harris Hawks Algorithm

被引:7
|
作者
Xu, Jing [1 ,2 ]
Ren, Chaofan [2 ]
Chang, Xiaonan [2 ]
机构
[1] Jiangsu Univ Sci & Technol, Marine Equipment & Technol Inst, 2 Mengxi Rd, Zhenjiang 212003, Peoples R China
[2] Jiangsu Univ Sci & Technol, Sch Mech Engn, 666 Changhui Rd, Zhenjiang 212114, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
time-optimal trajectory planning; quintic polynomial interpolation; Harris hawks algorithm; nonlinear energy decrement strategy; OPTIMIZATION;
D O I
10.3390/axioms12030245
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Time-optimal trajectory planning is one of the most important ways to improve work efficiency and reduce cost and plays an important role in practical application scenarios of robots. Therefore, it is necessary to optimize the running time of the trajectory. In this paper, a robot time-optimal trajectory planning method based on quintic polynomial interpolation and an improved Harris hawks algorithm is proposed. Interpolation with a quintic polynomial has a smooth angular velocity and no acceleration jumps. It has widespread application in the realm of robot trajectory planning. However, the interpolation time is usually obtained by testing experience, and there is no unified criterion to determine it, so it is difficult to obtain the optimal trajectory running time. Because the Harris hawks algorithm adopts a multi-population search strategy, compared with other swarm intelligent optimization algorithms such as the particle swarm optimization algorithm and the fruit fly optimization algorithm, it can avoid problems such as single population diversity, low mutation probability, and easily falling into the local optimum. Therefore, the Harris hawks algorithm is introduced to overcome this problem. However, because some key parameters in HHO are simply set to constant or linear attenuation, efficient optimization cannot be achieved. Therefore, the nonlinear energy decrement strategy is introduced in the basic Harris hawks algorithm to improve the convergence speed and accuracy. The results show that the optimal time of the proposed algorithm is reduced by 1.1062 s, 0.5705 s, and 0.3133 s, respectively, and improved by 33.39%, 19.66%, and 12.24% compared with those based on particle swarm optimization, fruit fly algorithm, and Harris hawks algorithms, respectively. In multiple groups of repeated experiments, compared with particle swarm optimization, the fruit fly algorithm, and the Harris hawks algorithm, the computational efficiency was reduced by 4.7019 s, 1.2016 s, and 0.2875 s, respectively, and increased by 52.40%, 21.96%, and 6.30%. Under the optimal time, the maximum angular displacement, angular velocity, and angular acceleration of each joint trajectory meet the constraint conditions, and their average values are only 75.51%, 38.41%, and 28.73% of the maximum constraint. Finally, the robot end-effector trajectory passes through the pose points steadily and continuously under the cartesian space optimal time.
引用
收藏
页数:20
相关论文
共 50 条
  • [41] A Convex Optimization Method to Time-Optimal Trajectory Planning With Jerk Constraint for Industrial Robotic Manipulators
    Ji, Chen
    Zhang, Zhongqiang
    Cheng, Guanggui
    Kong, Minxiu
    Li, Ruifeng
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2024, 21 (04) : 7629 - 7646
  • [42] Toward Time-Optimal Trajectory Planning for Autonomous Ship Maneuvering in Close-Range Encounters
    Li, Guoyuan
    Hildre, Hans Petter
    Zhang, Houxiang
    IEEE JOURNAL OF OCEANIC ENGINEERING, 2020, 45 (04) : 1219 - 1234
  • [43] Virtual Passive-Joint Space Based Time-Optimal Trajectory Planning for a 4-DOF Parallel Manipulator
    Zhao, Jie
    Yang, Guilin
    Shi, Haoyu
    Chen, Silu
    Chen, Chin-Yin
    Zhang, Chi
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2023, 8 (08) : 5039 - 5046
  • [44] Tree-Search-Based Any-Time Time-Optimal Path-Constrained Trajectory Planning With Inadmissible Island Constraints
    Shen, Peiyao
    Zhang, Xuebo
    Fang, Yongchun
    IEEE ACCESS, 2019, 7 : 1040 - 1051
  • [45] Quintic Pythagorean-Hodograph Curves Based Trajectory Planning for Delta Robot with a Prescribed Geometrical Constraint
    Liang, Xu
    Su, Tingting
    APPLIED SCIENCES-BASEL, 2019, 9 (21):
  • [46] Time-optimal trajectory optimization of serial robotic manipulator with kinematic and dynamic limits based on improved particle swarm optimization
    Yang, Yu
    Xu, Hong-ze
    Li, Shao-hua
    Zhang, Ling-ling
    Yao, Xiu-ming
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2022, 120 (1-2) : 1253 - 1264
  • [47] Time-optimal trajectory optimization of serial robotic manipulator with kinematic and dynamic limits based on improved particle swarm optimization
    Yu Yang
    Hong-ze Xu
    Shao-hua Li
    Ling-ling Zhang
    Xiu-ming Yao
    The International Journal of Advanced Manufacturing Technology, 2022, 120 : 1253 - 1264
  • [48] Efficient algorithm for time-optimal feedrate planning and smoothing with confined chord error and acceleration
    Zhang, Ke
    Yuan, Chun-Ming
    Gao, Xiao-Shan
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (9-12) : 1685 - 1697
  • [49] An efficient stochastic approach for robust time-optimal trajectory planning of robotic manipulators under limited actuation
    Zhao, Ming-Yong
    Gao, Xiao-Shan
    Zhang, Qiang
    ROBOTICA, 2017, 35 (12) : 2400 - 2417
  • [50] Time-optimal cornering trajectory planning for car-like mobile robots containing actuator dynamics
    Byeon, Yong Jin
    Kim, Byung Kook
    ROBOTICA, 2022, 40 (05) : 1627 - 1649