Spider robot walking gait optimization using Jaya multi-objective optimization algorithm

被引:0
|
作者
Dat, Nguyen Tien [1 ,2 ]
Anh, Ho Pham Huy [1 ,2 ]
机构
[1] Ho Chi Minh City Univ Technol HCMUT, 268 Ly Thuong Kiet St, Dist 10, Ho Chi Minh City, Vietnam
[2] Vietnam Natl Univ Ho Chi Minh City VNU HCM, Linh Trung Ward, Ho Chi Minh City, Vietnam
关键词
Spider robot; Legged robotics; Multi-objective MO-Jaya algorithm;
D O I
10.1007/s41315-024-00381-8
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
The legs must move in a pattern to ensure that a four-legged robot walks organically and uses less energy. This is still a challenging issue today since four-legged creatures with incredibly complicated structures and precise motions are beyond the reach of current technology. This paper proposes a gait generation model for a spider robot that examines the guarantee between stability and speed. First, the robot spider's movement rules are initiatively determined via four gait parameters-vertical step length, horizontal step length, leg lift, and knee bend. Meanwhile, the 3rd-order interpolation function determines the trajectory of the hips and feet at each leg. By applying analytical methods to solve the inverse kinematics issue, the orbits of the hips and feet at the four legs of the spider robot will be used to deduce twelve joint angle orbits at those locations. Then, a multi-objective function is proposed regarding both speed and stability based on the gait characteristics (gait parameters, CoP/ZMP trajectory) of the spider robot as to train the gait generation model by addressing the forward kinematics issue analytically. Finally, the multi-object MO-Jaya optimization technique is used to find four optimal gait parameters so that the spider robot performs a stable walking gait at the fastest speed. This proposal is implemented for the experiment B3-SBOT spider robot, simulation/experiment outcomes show that B3-SBOT moves at its fastest feasible speed while walking stably.
引用
收藏
页码:189 / 198
页数:10
相关论文
共 50 条
  • [41] Multi-objective Brainstorm Optimization Algorithm for Sparse Optimization
    Liang, J. J.
    Wang, P.
    Yue, C. T.
    Yu, K. J.
    Li, Z. H.
    Qu, B. Y.
    2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 2211 - 2218
  • [42] Application of multi-objective optimization genetic algorithm to robot path planning
    Shen, Xiao-Ning
    Guo, Yu
    Chen, Qing-Wei
    Hu, Wei-Li
    Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology, 2006, 30 (06): : 659 - 663
  • [43] Quadruped Robot Leg Optimization Based on a Multi-Objective Genetic Algorithm
    Zhang, Yongnian
    Wang, Xinsheng
    Xin, Yuhong
    Wu, Yang
    Kang, Min
    Wang, Xiaochan
    MECHANIKA, 2017, 23 (06): : 881 - 890
  • [44] A Decentralized Multi-objective Optimization Algorithm
    Blondin, Maude J.
    Hale, Matthew
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2021, 189 (02) : 458 - 485
  • [45] Pruning Algorithm for Multi-objective Optimization
    Sudeng, Sufian
    Wattanapongsakorn, Naruemon
    2013 10TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE), 2013, : 70 - 75
  • [46] Novel multi-objective optimization algorithm
    Zeng, Jie
    Nie, Wei
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2014, 25 (04) : 697 - 710
  • [47] An interval algorithm for multi-objective optimization
    Ruetsch, GR
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2005, 30 (01) : 27 - 37
  • [48] Multi-objective Flower Algorithm for Optimization
    Yang, Xin-She
    Karamanoglu, Mehmet
    He, Xingshi
    2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2013, 18 : 861 - 868
  • [49] A Decentralized Multi-objective Optimization Algorithm
    Maude J. Blondin
    Matthew Hale
    Journal of Optimization Theory and Applications, 2021, 189 : 458 - 485
  • [50] An interval algorithm for multi-objective optimization
    G.R. Ruetsch
    Structural and Multidisciplinary Optimization, 2005, 30 : 27 - 37