| Autor: |
Guojun Zhao, Bo Tao, Du Jiang, Juntong Yun, Hanwen Fan |
| Jazyk: |
angličtina |
| Rok vydání: |
2024 |
| Předmět: |
|
| Zdroj: |
Biomimetics, Vol 9, Iss 10, p 627 (2024) |
| Druh dokumentu: |
article |
| ISSN: |
2313-7673 |
| DOI: |
10.3390/biomimetics9100627 |
| Popis: |
The inverse kinematics of robotic manipulators involves determining an appropriate joint configuration to achieve a specified end-effector position. This problem is challenging because the inverse kinematics of manipulators are highly nonlinear and complexly coupled. To address this challenge, the bald eagle search optimization algorithm is introduced. This algorithm combines the advantages of evolutionary and swarm techniques, making it more effective at solving nonlinear problems and improving search efficiency. Due to the tendency of the algorithm to fall into local optima, the Lévy flight strategy is introduced to enhance its performance. This strategy adopts a heavy-tailed distribution to generate long-distance jumps, thereby preventing the algorithm from becoming trapped in local optima and enhancing its global search efficiency. The experiments first evaluated the accuracy and robustness of the proposed algorithm based on the inverse kinematics problem of manipulators, achieving a solution accuracy of up to 10−18 m. Subsequently, the proposed algorithm was compared with other algorithms using the CEC2017 test functions. The results showed that the improved algorithm significantly outperformed the original in accuracy, convergence speed, and stability. Specifically, it achieved over 70% improvement in both standard deviation and mean for several test functions, demonstrating the effectiveness of the Lévy flight strategy in enhancing global search capabilities. Furthermore, the practicality of the proposed algorithm was verified through two real engineering optimization problems. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|
