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 条
  • [31] MULTI-OBJECTIVE OPTIMIZATION OF ROBOT GRIPPERS
    Stefanache, Cornel
    Stanescu, Cristina
    Tudose, Lucian
    SIXTH INTERNATIONAL SYMPOSIUM ABOUT FORMING AND DESIGN IN MECHANICAL ENGINEERING, 2010, : 63 - 68
  • [32] Modified Multi-Objective Particle Swarm Optimization Algorithm for Multi-objective Optimization Problems
    Qiao, Ying
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2012, PT I, 2012, 7331 : 520 - 527
  • [33] Evolutionary Multi-Objective Optimization for Biped Walking
    Yanase, Toshihiko
    Iba, Hitoshi
    SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2008, 5361 : 635 - 644
  • [34] POTENTIAL FIELD MULTI-OBJECTIVE OPTIMIZATION FOR ROBOT PATH PLANNING USING GENETIC ALGORITHM
    Shehata, Hussein Hanidy
    Schlattmann, Josef
    MOBILE SERVICE ROBOTICS, 2014, : 149 - 158
  • [35] Genetic algorithm for multi-objective optimization using GDEA
    Yun, Y
    Yoon, M
    Nakayama, H
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 409 - 416
  • [36] Supervised Multi-objective Optimization Algorithm Using Estimation
    Takagi, Tomoaki
    Takadama, Keiki
    Sato, Hiroyuki
    2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
  • [37] Multi-objective Optimization Immune Algorithm Using Clustering
    Sun Fang
    Chen Yunfang
    Wu Weimin
    2010 INTERNATIONAL CONFERENCE ON BIO-INSPIRED SYSTEMS AND SIGNAL PROCESSING (ICBSSP 2010), 2010, : 9 - 13
  • [38] Multi-objective Optimization Immune Algorithm Using Clustering
    Sun Fang
    Chen Yunfang
    Wu Weimin
    COMPUTING AND INTELLIGENT SYSTEMS, PT IV, 2011, 234 : 242 - 251
  • [39] Grasshopper optimization algorithm for multi-objective optimization problems
    Mirjalili, Seyedeh Zahra
    Mirjalili, Seyedali
    Saremi, Shahrzad
    Faris, Hossam
    Aljarah, Ibrahim
    APPLIED INTELLIGENCE, 2018, 48 (04) : 805 - 820
  • [40] Grasshopper optimization algorithm for multi-objective optimization problems
    Seyedeh Zahra Mirjalili
    Seyedali Mirjalili
    Shahrzad Saremi
    Hossam Faris
    Ibrahim Aljarah
    Applied Intelligence, 2018, 48 : 805 - 820