中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Parameter optimization of eel robot based on NSGA-II algorithm

文献类型:会议论文

作者Zhang AF(张安翻)1; Ma SG(马书根)3; Li B(李斌)2; Wang MH(王明辉)2; Chang J(常健)2
出版日期2019
会议日期August 8-11, 2019
会议地点Shenyang, China
关键词Parameter optimization Gait pattern NSGA-II Eel robot
页码3-15
英文摘要In order to obtain an efficient gait, this paper studies the swimming efficiency of underwater eel robot in different gaits. The optimal gait parameters combination of three gaits is studied by using Non-dominated Sorting in Genetic algorithm (NSGA-II). The relationship between input power and velocity in different gait patterns is analyzed, and the optimal gait parameters combination in each gait patterns is obtained. The simulation results show that the new gait only need less input power than the serpentine gait in the same velocity, and the new gait has faster velocity compared to the eel gait using the same joint input power. Finally, the above founds have further verified by experiments. The experiments have proved that the new gait has higher swimming efficiency. Besides, It is found that both the optimal gait amplitude and optimal phase shift exist in both the new gait and the serpentine gait.
产权排序1
会议录Intelligent Robotics and Applications - 12th International Conference, ICIRA 2019, Proceedings
会议录出版者Springer Verlag
会议录出版地Berlin
语种英语
ISSN号0302-9743
ISBN号978-3-030-27534-1
WOS记录号WOS:000569253000001
源URL[http://ir.sia.cn/handle/173321/25502]  
专题沈阳自动化研究所_机器人学研究室
通讯作者Zhang AF(张安翻)
作者单位1.Faculty of Marine Science and Technology, Hainan Tropical Ocean University, Sanya, China
2.State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, China
3.Department of Robotics, Ritsumeikan University, Shiga-ken 525-8577, Japan
推荐引用方式
GB/T 7714
Zhang AF,Ma SG,Li B,et al. Parameter optimization of eel robot based on NSGA-II algorithm[C]. 见:. Shenyang, China. August 8-11, 2019.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。