基于梯度的群体避障算法

A. Ram
{"title":"基于梯度的群体避障算法","authors":"A. Ram","doi":"10.1109/RCTFC.2016.7893406","DOIUrl":null,"url":null,"abstract":"In this paper, a hybrid approach to obstacle avoidance, based on Particle Swarm Optimisation is proposed. This method provides significantly faster convergence, compared to classical approaches using potential fields and gradient descent. The potential functions being used are presented, along with the results, one would obtain by employing gradient descent, for comparison. The results obtained by using hybrid-algorithm, clearly show the significant reduction in number of iterations taken for convergence, in comparison to the exponential time, typically taken by gradient descent. The penultimate section explains the approach taken to adapt the algorithm being proposed, for applications with GPS coordinates. Experimental results for the same are also presented herewith.","PeriodicalId":147181,"journal":{"name":"2016 International Conference on Robotics: Current Trends and Future Challenges (RCTFC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Obstacle avoidance algorithm using gradient based Swarm techniques\",\"authors\":\"A. Ram\",\"doi\":\"10.1109/RCTFC.2016.7893406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a hybrid approach to obstacle avoidance, based on Particle Swarm Optimisation is proposed. This method provides significantly faster convergence, compared to classical approaches using potential fields and gradient descent. The potential functions being used are presented, along with the results, one would obtain by employing gradient descent, for comparison. The results obtained by using hybrid-algorithm, clearly show the significant reduction in number of iterations taken for convergence, in comparison to the exponential time, typically taken by gradient descent. The penultimate section explains the approach taken to adapt the algorithm being proposed, for applications with GPS coordinates. Experimental results for the same are also presented herewith.\",\"PeriodicalId\":147181,\"journal\":{\"name\":\"2016 International Conference on Robotics: Current Trends and Future Challenges (RCTFC)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Robotics: Current Trends and Future Challenges (RCTFC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RCTFC.2016.7893406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Robotics: Current Trends and Future Challenges (RCTFC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RCTFC.2016.7893406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于粒子群算法的混合避障方法。与使用势场和梯度下降的经典方法相比,该方法提供了明显更快的收敛速度。所使用的势函数,连同使用梯度下降法可以得到的结果一起被提出,以供比较。使用混合算法获得的结果清楚地表明,与通常采用梯度下降法的指数时间相比,收敛所需的迭代次数显著减少。倒数第二节解释了将所提出的算法用于具有GPS坐标的应用程序的方法。文中还给出了该方法的实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Obstacle avoidance algorithm using gradient based Swarm techniques
In this paper, a hybrid approach to obstacle avoidance, based on Particle Swarm Optimisation is proposed. This method provides significantly faster convergence, compared to classical approaches using potential fields and gradient descent. The potential functions being used are presented, along with the results, one would obtain by employing gradient descent, for comparison. The results obtained by using hybrid-algorithm, clearly show the significant reduction in number of iterations taken for convergence, in comparison to the exponential time, typically taken by gradient descent. The penultimate section explains the approach taken to adapt the algorithm being proposed, for applications with GPS coordinates. Experimental results for the same are also presented herewith.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信