Self-Adjusting Locomotion on a Partially Broken-down Quadrupedal Biomorphic Robot by Evolutionary Algorithms

被引:0
|
作者
Qiu, Guo-Yuan [1 ]
Wu, Shih-Hung [1 ]
机构
[1] Chaoyang Univ Technol, Dept Comp Sci & Informat Engn, Taichung, Taiwan
关键词
D O I
暂无
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Biomorphic robots have become an interesting topic recently. These robots can achieve certain goals that wheel-based robots cannot. The biomorphic robots usually have more joints and more legs. However, the more motors on a robot the more risk that one of them might break down at an unexpected moment. Self-adjusting locomotion ability can be a help to make a partially dysfunctional biomorphic robot move. Online evolutionary algorithm is a promising way to achieve such a task. The robot receives feedback from the environment as to the fitness for its evolutionary goal. In this paper, we adopt the PSO (particle swarm optimization) algorithm as our online evolutionary algorithm and test it on a partially broken-down quadrupedal biomorphic robot. The experimental results show that the robot can adjust its actions to move even when one leg is removed.
引用
收藏
页数:6
相关论文
共 11 条
  • [1] Automatic Adaptive Locomotion on Partially Breakdown Quadrupedal Biomorphic Robot by Multi-Objective Evolutionary Algorithms
    Chen, Hou-Yu
    Wu, Shih-Hung
    INTELLIGENT SYSTEMS AND APPLICATIONS (ICS 2014), 2015, 274 : 175 - 184
  • [2] Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
    Rajabi, Amirhossein
    Witt, Carsten
    GECCO'20: PROCEEDINGS OF THE 2020 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2020, : 1314 - 1322
  • [3] Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
    Rajabi, Amirhossein
    Witt, Carsten
    ALGORITHMICA, 2022, 84 (06) : 1694 - 1723
  • [4] Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
    Amirhossein Rajabi
    Carsten Witt
    Algorithmica, 2022, 84 : 1694 - 1723
  • [5] Self-adjusting Evolutionary Algorithms are Slow on a Class of Multimodal Landscapes
    Lengler, Johannes
    Sturm, Konstantin
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, 15150 LNCS : 3 - 18
  • [6] Self-adjusting Evolutionary Algorithms are Slow on a Class of Multimodal Landscapes
    Lengler, Johannes
    Sturm, Konstantin
    PARALLEL PROBLEM SOLVING FROM NATURE-PSN XVIII, PPSN 2024, PT III, 2024, 15150 : 3 - 18
  • [7] Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates
    Rodionova, Anna
    Antonov, Kirill
    Buzdalova, Arina
    Doerr, Carola
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 855 - 863
  • [8] Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter
    Fajardo, Mario Alejandro Hevia
    Sudholt, Dirk
    ALGORITHMICA, 2024, 86 (02) : 526 - 565
  • [9] Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter
    Mario Alejandro Hevia Fajardo
    Dirk Sudholt
    Algorithmica, 2024, 86 : 526 - 565
  • [10] Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates Matter
    Fajardo, Mario Alejandro Hevia
    Sudholt, Dirk
    PROCEEDINGS OF THE 2021 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'21), 2021, : 1151 - 1159