Obstacle Avoidance Path Planning of 7-DOF Redundant Manipulator Based on Improved Ant Colony Optimization

Q4 Engineering
Wenjie Wang, Shuai Wang, Yuting Cao, Yang Luo, Xiaohua Wang
{"title":"Obstacle Avoidance Path Planning of 7-DOF Redundant Manipulator Based on Improved Ant Colony Optimization","authors":"Wenjie Wang, Shuai Wang, Yuting Cao, Yang Luo, Xiaohua Wang","doi":"10.2174/2212797616666230417104506","DOIUrl":null,"url":null,"abstract":"\n\nObstacle avoidance path planning is an important parameter of robot manip-ulators. Path planning can directly affect the working efficiency of the ma-nipulator.\n\n\n\nThis study aims to summarize the optimization design method from a large number of literature and propose a new optimization design method to make the planned obstacle avoidance path of the manipulator shorter and smooth-er.\n\n\n\nThe forward and inverse kinematics of the redundant manipulator is solved. Secondly, the obstacle and the robot manipulator envelope are simplified for collision detection. Then, the ant colony algorithm is improved by adding an obstacle environment to the construction of the heuristic function and dy-namically adjusting the heuristic function factor to make the shortest path distance planned by the algorithm. Finally, the worst ant colony is added to the pheromone update to avoid the algorithm falling into the local optimal solution.\n\n\n\nThrough experiments and comparative studies, the optimized design process shows that the path planned by the improved ant colony algorithm has obvi-ous advantages of shorter path distance and smoother path distance, which verifies the rationality of the improved algorithm.\n\n\n\nThis method optimizes the convergence speed of the ant colony algorithm and avoids the ant colony algorithm from falling into the local optimal solu-tion, which is of great significance for improving the obstacle avoidance path planning problem of a redundant manipulator with a degree of freedom.\n","PeriodicalId":39169,"journal":{"name":"Recent Patents on Mechanical Engineering","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Recent Patents on Mechanical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2174/2212797616666230417104506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

Obstacle avoidance path planning is an important parameter of robot manip-ulators. Path planning can directly affect the working efficiency of the ma-nipulator. This study aims to summarize the optimization design method from a large number of literature and propose a new optimization design method to make the planned obstacle avoidance path of the manipulator shorter and smooth-er. The forward and inverse kinematics of the redundant manipulator is solved. Secondly, the obstacle and the robot manipulator envelope are simplified for collision detection. Then, the ant colony algorithm is improved by adding an obstacle environment to the construction of the heuristic function and dy-namically adjusting the heuristic function factor to make the shortest path distance planned by the algorithm. Finally, the worst ant colony is added to the pheromone update to avoid the algorithm falling into the local optimal solution. Through experiments and comparative studies, the optimized design process shows that the path planned by the improved ant colony algorithm has obvi-ous advantages of shorter path distance and smoother path distance, which verifies the rationality of the improved algorithm. This method optimizes the convergence speed of the ant colony algorithm and avoids the ant colony algorithm from falling into the local optimal solu-tion, which is of great significance for improving the obstacle avoidance path planning problem of a redundant manipulator with a degree of freedom.
基于改进蚁群优化的7自由度冗余机械臂避障路径规划
避障路径规划是机器人操纵器的一个重要参数。路径规划直接影响机械手的工作效率。本研究旨在总结大量文献中的优化设计方法,并提出一种新的优化设计法,使机械手规划的避障路径更短、更平滑。解决冗余度机械手的正运动学和逆运动学问题。其次,为了进行碰撞检测,简化了障碍物和机械手的包络。然后,通过在启发式函数的构造中添加障碍环境,并动态调整启发式函数因子,使算法规划出最短路径距离,对蚁群算法进行了改进。最后,在信息素更新中加入最差蚁群,避免算法陷入局部最优解。通过实验和对比研究,优化设计过程表明,改进蚁群算法规划的路径具有路径距离短、路径距离平滑的明显优点,验证了改进算法的合理性。该方法优化了蚁群算法的收敛速度,避免了蚁群算法陷入局部最优解,对改进自由度冗余机械手的避障路径规划问题具有重要意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Recent Patents on Mechanical Engineering
Recent Patents on Mechanical Engineering Engineering-Mechanical Engineering
CiteScore
0.80
自引率
0.00%
发文量
48
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信