A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots
Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based...
Ausführliche Beschreibung
Autor*in: |
Ruoyu Xu [verfasserIn] Chunhui Zhao [verfasserIn] Jiaxing Li [verfasserIn] Jinwen Hu [verfasserIn] Xiaolei Hou [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2023 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
In: Electronics - MDPI AG, 2013, 12(2023), 7, p 1564 |
---|---|
Übergeordnetes Werk: |
volume:12 ; year:2023 ; number:7, p 1564 |
Links: |
---|
DOI / URN: |
10.3390/electronics12071564 |
---|
Katalog-ID: |
DOAJ089388402 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | DOAJ089388402 | ||
003 | DE-627 | ||
005 | 20240413043334.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230505s2023 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.3390/electronics12071564 |2 doi | |
035 | |a (DE-627)DOAJ089388402 | ||
035 | |a (DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
050 | 0 | |a TK7800-8360 | |
100 | 0 | |a Ruoyu Xu |e verfasserin |4 aut | |
245 | 1 | 2 | |a A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots |
264 | 1 | |c 2023 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. | ||
650 | 4 | |a quadruped robots | |
650 | 4 | |a trajectory planning | |
650 | 4 | |a polynomial interpolation algorithm | |
650 | 4 | |a whale optimization algorithm | |
650 | 4 | |a simulated annealing algorithm | |
653 | 0 | |a Electronics | |
700 | 0 | |a Chunhui Zhao |e verfasserin |4 aut | |
700 | 0 | |a Jiaxing Li |e verfasserin |4 aut | |
700 | 0 | |a Jinwen Hu |e verfasserin |4 aut | |
700 | 0 | |a Xiaolei Hou |e verfasserin |4 aut | |
773 | 0 | 8 | |i In |t Electronics |d MDPI AG, 2013 |g 12(2023), 7, p 1564 |w (DE-627)718626478 |w (DE-600)2662127-7 |x 20799292 |7 nnns |
773 | 1 | 8 | |g volume:12 |g year:2023 |g number:7, p 1564 |
856 | 4 | 0 | |u https://doi.org/10.3390/electronics12071564 |z kostenfrei |
856 | 4 | 0 | |u https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933 |z kostenfrei |
856 | 4 | 0 | |u https://www.mdpi.com/2079-9292/12/7/1564 |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/2079-9292 |y Journal toc |z kostenfrei |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_DOAJ | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_39 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_170 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_4012 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4367 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 12 |j 2023 |e 7, p 1564 |
author_variant |
r x rx c z cz j l jl j h jh x h xh |
---|---|
matchkey_str |
article:20799292:2023----::hbiipoewaepiiainiuaeanaigloihfrrjcoy |
hierarchy_sort_str |
2023 |
callnumber-subject-code |
TK |
publishDate |
2023 |
allfields |
10.3390/electronics12071564 doi (DE-627)DOAJ089388402 (DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933 DE-627 ger DE-627 rakwb eng TK7800-8360 Ruoyu Xu verfasserin aut A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. quadruped robots trajectory planning polynomial interpolation algorithm whale optimization algorithm simulated annealing algorithm Electronics Chunhui Zhao verfasserin aut Jiaxing Li verfasserin aut Jinwen Hu verfasserin aut Xiaolei Hou verfasserin aut In Electronics MDPI AG, 2013 12(2023), 7, p 1564 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:12 year:2023 number:7, p 1564 https://doi.org/10.3390/electronics12071564 kostenfrei https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933 kostenfrei https://www.mdpi.com/2079-9292/12/7/1564 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 12 2023 7, p 1564 |
spelling |
10.3390/electronics12071564 doi (DE-627)DOAJ089388402 (DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933 DE-627 ger DE-627 rakwb eng TK7800-8360 Ruoyu Xu verfasserin aut A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. quadruped robots trajectory planning polynomial interpolation algorithm whale optimization algorithm simulated annealing algorithm Electronics Chunhui Zhao verfasserin aut Jiaxing Li verfasserin aut Jinwen Hu verfasserin aut Xiaolei Hou verfasserin aut In Electronics MDPI AG, 2013 12(2023), 7, p 1564 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:12 year:2023 number:7, p 1564 https://doi.org/10.3390/electronics12071564 kostenfrei https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933 kostenfrei https://www.mdpi.com/2079-9292/12/7/1564 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 12 2023 7, p 1564 |
allfields_unstemmed |
10.3390/electronics12071564 doi (DE-627)DOAJ089388402 (DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933 DE-627 ger DE-627 rakwb eng TK7800-8360 Ruoyu Xu verfasserin aut A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. quadruped robots trajectory planning polynomial interpolation algorithm whale optimization algorithm simulated annealing algorithm Electronics Chunhui Zhao verfasserin aut Jiaxing Li verfasserin aut Jinwen Hu verfasserin aut Xiaolei Hou verfasserin aut In Electronics MDPI AG, 2013 12(2023), 7, p 1564 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:12 year:2023 number:7, p 1564 https://doi.org/10.3390/electronics12071564 kostenfrei https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933 kostenfrei https://www.mdpi.com/2079-9292/12/7/1564 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 12 2023 7, p 1564 |
allfieldsGer |
10.3390/electronics12071564 doi (DE-627)DOAJ089388402 (DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933 DE-627 ger DE-627 rakwb eng TK7800-8360 Ruoyu Xu verfasserin aut A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. quadruped robots trajectory planning polynomial interpolation algorithm whale optimization algorithm simulated annealing algorithm Electronics Chunhui Zhao verfasserin aut Jiaxing Li verfasserin aut Jinwen Hu verfasserin aut Xiaolei Hou verfasserin aut In Electronics MDPI AG, 2013 12(2023), 7, p 1564 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:12 year:2023 number:7, p 1564 https://doi.org/10.3390/electronics12071564 kostenfrei https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933 kostenfrei https://www.mdpi.com/2079-9292/12/7/1564 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 12 2023 7, p 1564 |
allfieldsSound |
10.3390/electronics12071564 doi (DE-627)DOAJ089388402 (DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933 DE-627 ger DE-627 rakwb eng TK7800-8360 Ruoyu Xu verfasserin aut A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. quadruped robots trajectory planning polynomial interpolation algorithm whale optimization algorithm simulated annealing algorithm Electronics Chunhui Zhao verfasserin aut Jiaxing Li verfasserin aut Jinwen Hu verfasserin aut Xiaolei Hou verfasserin aut In Electronics MDPI AG, 2013 12(2023), 7, p 1564 (DE-627)718626478 (DE-600)2662127-7 20799292 nnns volume:12 year:2023 number:7, p 1564 https://doi.org/10.3390/electronics12071564 kostenfrei https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933 kostenfrei https://www.mdpi.com/2079-9292/12/7/1564 kostenfrei https://doaj.org/toc/2079-9292 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 12 2023 7, p 1564 |
language |
English |
source |
In Electronics 12(2023), 7, p 1564 volume:12 year:2023 number:7, p 1564 |
sourceStr |
In Electronics 12(2023), 7, p 1564 volume:12 year:2023 number:7, p 1564 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
quadruped robots trajectory planning polynomial interpolation algorithm whale optimization algorithm simulated annealing algorithm Electronics |
isfreeaccess_bool |
true |
container_title |
Electronics |
authorswithroles_txt_mv |
Ruoyu Xu @@aut@@ Chunhui Zhao @@aut@@ Jiaxing Li @@aut@@ Jinwen Hu @@aut@@ Xiaolei Hou @@aut@@ |
publishDateDaySort_date |
2023-01-01T00:00:00Z |
hierarchy_top_id |
718626478 |
id |
DOAJ089388402 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ089388402</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240413043334.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230505s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/electronics12071564</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ089388402</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7800-8360</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Ruoyu Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">quadruped robots</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">trajectory planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">polynomial interpolation algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">whale optimization algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">simulated annealing algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Chunhui Zhao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jiaxing Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jinwen Hu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Xiaolei Hou</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Electronics</subfield><subfield code="d">MDPI AG, 2013</subfield><subfield code="g">12(2023), 7, p 1564</subfield><subfield code="w">(DE-627)718626478</subfield><subfield code="w">(DE-600)2662127-7</subfield><subfield code="x">20799292</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:12</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:7, p 1564</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/electronics12071564</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/2079-9292/12/7/1564</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2079-9292</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">12</subfield><subfield code="j">2023</subfield><subfield code="e">7, p 1564</subfield></datafield></record></collection>
|
callnumber-first |
T - Technology |
author |
Ruoyu Xu |
spellingShingle |
Ruoyu Xu misc TK7800-8360 misc quadruped robots misc trajectory planning misc polynomial interpolation algorithm misc whale optimization algorithm misc simulated annealing algorithm misc Electronics A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots |
authorStr |
Ruoyu Xu |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)718626478 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut aut aut aut |
collection |
DOAJ |
remote_str |
true |
callnumber-label |
TK7800-8360 |
illustrated |
Not Illustrated |
issn |
20799292 |
topic_title |
TK7800-8360 A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots quadruped robots trajectory planning polynomial interpolation algorithm whale optimization algorithm simulated annealing algorithm |
topic |
misc TK7800-8360 misc quadruped robots misc trajectory planning misc polynomial interpolation algorithm misc whale optimization algorithm misc simulated annealing algorithm misc Electronics |
topic_unstemmed |
misc TK7800-8360 misc quadruped robots misc trajectory planning misc polynomial interpolation algorithm misc whale optimization algorithm misc simulated annealing algorithm misc Electronics |
topic_browse |
misc TK7800-8360 misc quadruped robots misc trajectory planning misc polynomial interpolation algorithm misc whale optimization algorithm misc simulated annealing algorithm misc Electronics |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Electronics |
hierarchy_parent_id |
718626478 |
hierarchy_top_title |
Electronics |
isfreeaccess_txt |
true |
familylinks_str_mv |
(DE-627)718626478 (DE-600)2662127-7 |
title |
A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots |
ctrlnum |
(DE-627)DOAJ089388402 (DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933 |
title_full |
A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots |
author_sort |
Ruoyu Xu |
journal |
Electronics |
journalStr |
Electronics |
callnumber-first-code |
T |
lang_code |
eng |
isOA_bool |
true |
recordtype |
marc |
publishDateSort |
2023 |
contenttype_str_mv |
txt |
author_browse |
Ruoyu Xu Chunhui Zhao Jiaxing Li Jinwen Hu Xiaolei Hou |
container_volume |
12 |
class |
TK7800-8360 |
format_se |
Elektronische Aufsätze |
author-letter |
Ruoyu Xu |
doi_str_mv |
10.3390/electronics12071564 |
author2-role |
verfasserin |
title_sort |
hybrid improved-whale-optimization–simulated-annealing algorithm for trajectory planning of quadruped robots |
callnumber |
TK7800-8360 |
title_auth |
A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots |
abstract |
Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. |
abstractGer |
Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. |
abstract_unstemmed |
Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
container_issue |
7, p 1564 |
title_short |
A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots |
url |
https://doi.org/10.3390/electronics12071564 https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933 https://www.mdpi.com/2079-9292/12/7/1564 https://doaj.org/toc/2079-9292 |
remote_bool |
true |
author2 |
Chunhui Zhao Jiaxing Li Jinwen Hu Xiaolei Hou |
author2Str |
Chunhui Zhao Jiaxing Li Jinwen Hu Xiaolei Hou |
ppnlink |
718626478 |
callnumber-subject |
TK - Electrical and Nuclear Engineering |
mediatype_str_mv |
c |
isOA_txt |
true |
hochschulschrift_bool |
false |
doi_str |
10.3390/electronics12071564 |
callnumber-a |
TK7800-8360 |
up_date |
2024-07-03T22:50:02.547Z |
_version_ |
1803600005746917376 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ089388402</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240413043334.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230505s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/electronics12071564</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ089388402</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ3f600bed5aa2488692c860b6bf37f933</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK7800-8360</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Ruoyu Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Hybrid Improved-Whale-Optimization–Simulated-Annealing Algorithm for Trajectory Planning of Quadruped Robots</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Traditional trajectory-planning methods are unable to achieve time optimization, resulting in slow response times to unexpected situations. To address this issue and improve the smoothness of joint trajectories and the movement time of quadruped robots, we propose a trajectory-planning method based on time optimization. This approach improves the whale optimization algorithm with simulated annealing (IWOA-SA) together with adaptive weights to prevent the whale optimization algorithm (WOA) from falling into local optima and to balance its exploration and exploitation abilities. We also use Markov chains of stochastic process theory to analyze the global convergence of the proposed algorithm. The results show that our optimization algorithm has stronger optimization ability and stability when compared to six representative algorithms using six different test function suites in multiple dimensions. Additionally, the proposed optimization algorithm consistently constrains the angular velocity of each joint within the range of kinematic constraints and reduces joint running time by approximately 6.25%, which indicates the effectiveness of this algorithm.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">quadruped robots</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">trajectory planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">polynomial interpolation algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">whale optimization algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">simulated annealing algorithm</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Chunhui Zhao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jiaxing Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jinwen Hu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Xiaolei Hou</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Electronics</subfield><subfield code="d">MDPI AG, 2013</subfield><subfield code="g">12(2023), 7, p 1564</subfield><subfield code="w">(DE-627)718626478</subfield><subfield code="w">(DE-600)2662127-7</subfield><subfield code="x">20799292</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:12</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:7, p 1564</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/electronics12071564</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/3f600bed5aa2488692c860b6bf37f933</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/2079-9292/12/7/1564</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2079-9292</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">12</subfield><subfield code="j">2023</subfield><subfield code="e">7, p 1564</subfield></datafield></record></collection>
|
score |
7.400571 |