机器人运动协调中的粒子群动态加速度系数优化

Tang Nyiak Tien, Kit Guan Lim, M. K. Tan, Soo Siang Yang, K. Teo
{"title":"机器人运动协调中的粒子群动态加速度系数优化","authors":"Tang Nyiak Tien, Kit Guan Lim, M. K. Tan, Soo Siang Yang, K. Teo","doi":"10.5013/ijssst.a.21.03.06","DOIUrl":null,"url":null,"abstract":"This paper focuses on improving an optimization process for swarm robots using Particle Swarm Optimization (PSO) by altering the acceleration coefficient from static to dynamic. In swarm robotic, motion coordination addresses the issue of avoiding a group of robots interfere with each other in a limited workspace, while achieving the global motion objective. PSO is commonly suggested in the literature to optimize path trajectory in robotic field. However, the typical PSO tends to be trapped in local optima. Therefore, a dynamic acceleration coefficient is proposed to optimize the cognitive and social coefficients of PSO in order to improve its exploration ability in seeking the global optimum solution. With this novel feature, PSO becomes less dependent on the chain of its past experience that it had explored in a certain region within the solution space. The effectiveness of the proposed method is tested on a simulated swarm robotic platform. Results show the proposed PSO with Dynamic Coefficient (DCPSO) is 1.09 seconds and 3.58 seconds faster than the typical PSO under dynamic and extreme conditions respectively.","PeriodicalId":14286,"journal":{"name":"International journal of simulation: systems, science & technology","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic Acceleration Coefficient of Particle Swarm Optimization in Robotics Motion Coordination\",\"authors\":\"Tang Nyiak Tien, Kit Guan Lim, M. K. Tan, Soo Siang Yang, K. Teo\",\"doi\":\"10.5013/ijssst.a.21.03.06\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses on improving an optimization process for swarm robots using Particle Swarm Optimization (PSO) by altering the acceleration coefficient from static to dynamic. In swarm robotic, motion coordination addresses the issue of avoiding a group of robots interfere with each other in a limited workspace, while achieving the global motion objective. PSO is commonly suggested in the literature to optimize path trajectory in robotic field. However, the typical PSO tends to be trapped in local optima. Therefore, a dynamic acceleration coefficient is proposed to optimize the cognitive and social coefficients of PSO in order to improve its exploration ability in seeking the global optimum solution. With this novel feature, PSO becomes less dependent on the chain of its past experience that it had explored in a certain region within the solution space. The effectiveness of the proposed method is tested on a simulated swarm robotic platform. Results show the proposed PSO with Dynamic Coefficient (DCPSO) is 1.09 seconds and 3.58 seconds faster than the typical PSO under dynamic and extreme conditions respectively.\",\"PeriodicalId\":14286,\"journal\":{\"name\":\"International journal of simulation: systems, science & technology\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of simulation: systems, science & technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5013/ijssst.a.21.03.06\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of simulation: systems, science & technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5013/ijssst.a.21.03.06","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了利用粒子群算法(Particle swarm optimization, PSO)改进群体机器人的优化过程,将加速度系数由静态改变为动态。在群体机器人中,运动协调解决了在有限的工作空间内避免一组机器人相互干扰,同时实现全局运动目标的问题。粒子群算法是机器人领域中常用的路径轨迹优化算法。然而,典型的粒子群算法往往陷入局部最优。为此,提出了一种动态加速度系数来优化粒子群的认知系数和社会系数,以提高粒子群寻求全局最优解的探索能力。有了这个新特性,粒子群算法就不那么依赖于它过去在解决方案空间的某个区域探索的经验链了。在仿真蜂群机器人平台上验证了该方法的有效性。结果表明,在动态和极端条件下,该动态系数粒子群比典型粒子群分别快1.09秒和3.58秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Acceleration Coefficient of Particle Swarm Optimization in Robotics Motion Coordination
This paper focuses on improving an optimization process for swarm robots using Particle Swarm Optimization (PSO) by altering the acceleration coefficient from static to dynamic. In swarm robotic, motion coordination addresses the issue of avoiding a group of robots interfere with each other in a limited workspace, while achieving the global motion objective. PSO is commonly suggested in the literature to optimize path trajectory in robotic field. However, the typical PSO tends to be trapped in local optima. Therefore, a dynamic acceleration coefficient is proposed to optimize the cognitive and social coefficients of PSO in order to improve its exploration ability in seeking the global optimum solution. With this novel feature, PSO becomes less dependent on the chain of its past experience that it had explored in a certain region within the solution space. The effectiveness of the proposed method is tested on a simulated swarm robotic platform. Results show the proposed PSO with Dynamic Coefficient (DCPSO) is 1.09 seconds and 3.58 seconds faster than the typical PSO under dynamic and extreme conditions respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信