Path planning with obstacle avoidance for soft robots based on improved particle swarm optimization algorithm

Hongwei Liu, Yang Jiang, Manlu Liu, Xinbin Zhang, Jianwen Huo, Haoxiang Su
{"title":"Path planning with obstacle avoidance for soft robots based on improved particle swarm optimization algorithm","authors":"Hongwei Liu, Yang Jiang, Manlu Liu, Xinbin Zhang, Jianwen Huo, Haoxiang Su","doi":"10.20517/ir.2023.31","DOIUrl":null,"url":null,"abstract":"Soft-bodied robots have the advantages of high flexibility and multiple degrees of freedom and have promising applications in exploring complex unstructured environments. Kinematic coupling exists for the soft robot in a problematic space environment for motion planning between the soft robot arm segments. In solving the soft robot inverse kinematics, there are only solutions or even no solutions, and soft robot obstacle avoidance control is tough to exist, as other problems. In this paper, we use the segmental constant curvature assumption to derive the positive and negative kinematic relationships and design the tip self-growth algorithm to reduce the difficulty of solving the parameters in the inverse kinematics of the soft robot to avoid kinematic coupling. Finally, by combining the improved particle swarm algorithm to optimize the paths, the convergence speed and reconciliation accuracy of the algorithm are further accelerated. The simulation results prove that the method can successfully move the soft robot in complex space with high computational efficiency and high accuracy, which verifies the effectiveness of the research.","PeriodicalId":100184,"journal":{"name":"Biomimetic Intelligence and Robotics","volume":"29 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biomimetic Intelligence and Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20517/ir.2023.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Soft-bodied robots have the advantages of high flexibility and multiple degrees of freedom and have promising applications in exploring complex unstructured environments. Kinematic coupling exists for the soft robot in a problematic space environment for motion planning between the soft robot arm segments. In solving the soft robot inverse kinematics, there are only solutions or even no solutions, and soft robot obstacle avoidance control is tough to exist, as other problems. In this paper, we use the segmental constant curvature assumption to derive the positive and negative kinematic relationships and design the tip self-growth algorithm to reduce the difficulty of solving the parameters in the inverse kinematics of the soft robot to avoid kinematic coupling. Finally, by combining the improved particle swarm algorithm to optimize the paths, the convergence speed and reconciliation accuracy of the algorithm are further accelerated. The simulation results prove that the method can successfully move the soft robot in complex space with high computational efficiency and high accuracy, which verifies the effectiveness of the research.
基于改进粒子群算法的软机器人避障路径规划
软体机器人具有高灵活性和多自由度的优点,在探索复杂的非结构化环境方面具有广阔的应用前景。在复杂的空间环境中,软机器人臂段之间存在运动耦合,需要进行运动规划。在求解软机器人逆运动学问题时,存在只有解甚至无解的问题,软机器人避障控制与其他问题一样难以存在。本文利用节段常曲率假设导出了软机器人的正、负运动学关系,并设计了尖端自生长算法,降低了软机器人逆运动学参数的求解难度,避免了运动学耦合。最后,结合改进的粒子群算法对路径进行优化,进一步加快了算法的收敛速度和调和精度。仿真结果表明,该方法能够成功实现软机器人在复杂空间中的移动,计算效率高,精度高,验证了研究的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.80
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信