基于改进二阶粒子群算法的机器人全局路径规划

Juan Li, Jinyu Su
{"title":"基于改进二阶粒子群算法的机器人全局路径规划","authors":"Juan Li, Jinyu Su","doi":"10.1109/ICMA54519.2022.9856139","DOIUrl":null,"url":null,"abstract":"When using particle swarm optimization (PSO) to realize the global path planning of the robot, premature convergence and falling into the local optimum often occur. Therefore, an improved second-order PSO is used to improve premature convergence and analyze its stability. The logistic function relationship is established between the inertia weight and the learning factors. Using linearly decreasing inertia weight and adaptive learning factors, making the inertia weight change together with the learning factors to change the global or local flight ability to improve the ability to jump out of the local optimum. Through simulation comparison, it is proved that the improved second-order PSO proposed in this paper has the ability to jump out of the local optimum in the global path planning, and at the same time avoids premature convergence, and can also improve the convergence speed of the algorithm, which verifies the effectiveness of the algorithm.","PeriodicalId":120073,"journal":{"name":"2022 IEEE International Conference on Mechatronics and Automation (ICMA)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robot Global Path Planning Based on Improved Second-Order PSO Algorithm\",\"authors\":\"Juan Li, Jinyu Su\",\"doi\":\"10.1109/ICMA54519.2022.9856139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When using particle swarm optimization (PSO) to realize the global path planning of the robot, premature convergence and falling into the local optimum often occur. Therefore, an improved second-order PSO is used to improve premature convergence and analyze its stability. The logistic function relationship is established between the inertia weight and the learning factors. Using linearly decreasing inertia weight and adaptive learning factors, making the inertia weight change together with the learning factors to change the global or local flight ability to improve the ability to jump out of the local optimum. Through simulation comparison, it is proved that the improved second-order PSO proposed in this paper has the ability to jump out of the local optimum in the global path planning, and at the same time avoids premature convergence, and can also improve the convergence speed of the algorithm, which verifies the effectiveness of the algorithm.\",\"PeriodicalId\":120073,\"journal\":{\"name\":\"2022 IEEE International Conference on Mechatronics and Automation (ICMA)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Mechatronics and Automation (ICMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMA54519.2022.9856139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Mechatronics and Automation (ICMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMA54519.2022.9856139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

利用粒子群算法实现机器人的全局路径规划时,经常出现过早收敛和陷入局部最优的问题。因此,采用改进的二阶粒子群算法改进其早收敛性并分析其稳定性。建立了惯性权重与学习因子之间的logistic函数关系。采用线性递减的惯性权值和自适应学习因子,使惯性权值随学习因子变化而改变全局或局部飞行能力,提高跳出局部最优的能力。通过仿真比较,证明本文提出的改进二阶粒子群算法在全局路径规划中具有跳出局部最优的能力,同时避免了过早收敛,还能提高算法的收敛速度,验证了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Robot Global Path Planning Based on Improved Second-Order PSO Algorithm
When using particle swarm optimization (PSO) to realize the global path planning of the robot, premature convergence and falling into the local optimum often occur. Therefore, an improved second-order PSO is used to improve premature convergence and analyze its stability. The logistic function relationship is established between the inertia weight and the learning factors. Using linearly decreasing inertia weight and adaptive learning factors, making the inertia weight change together with the learning factors to change the global or local flight ability to improve the ability to jump out of the local optimum. Through simulation comparison, it is proved that the improved second-order PSO proposed in this paper has the ability to jump out of the local optimum in the global path planning, and at the same time avoids premature convergence, and can also improve the convergence speed of the algorithm, which verifies the effectiveness of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Fuzzy Indrect Adaptive Robust Control for Upper Extremity Exoskeleton Driven by Pneumatic Artificial Muscle Visual Localization Strategy for Indoor Mobile Robots in the Complex Environment Smart Prosthetic Knee for Above-Knee Amputees Research on the recovery system of the fixed wing swarm based on the robotic vision in the marine environment Lightning Arrester Target Segmentation Algorithm Based on Improved DeepLabv3+ and GrabCut
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1