A random chemical reaction algorithm based on double containers for robot path planning

Qing Yang, Zhong Yang, Guoxiong Hu, Wei Du
{"title":"A random chemical reaction algorithm based on double containers for robot path planning","authors":"Qing Yang, Zhong Yang, Guoxiong Hu, Wei Du","doi":"10.1109/PIC.2017.8359581","DOIUrl":null,"url":null,"abstract":"Aiming at the path planning problem of mobile robots in unknown environment, a random chemical reaction algorithm based on double containers is proposed. The new algorithm is inspired by the bacterial foraging algorithm and applies a strategy based on randomly distributed chemical molecules around the robot, these molecules search the best path to the target location, while relying on the robot's own sensors to avoid obstacles. The selection criterion of the optimal path depends on the potential energy error and the distance error of the molecules on the detected obstacles or targets, and guides the robot to move in this direction. In order to evaluate the effectiveness of the algorithm, a series of simulations were made in three different scenarios and the results were compared. The results show that the algorithm can effectively avoid falling into local minimum. At the same time, the algorithm proposed can provide a shorter and smoother path, and the operation is more simple.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Progress in Informatics and Computing (PIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC.2017.8359581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aiming at the path planning problem of mobile robots in unknown environment, a random chemical reaction algorithm based on double containers is proposed. The new algorithm is inspired by the bacterial foraging algorithm and applies a strategy based on randomly distributed chemical molecules around the robot, these molecules search the best path to the target location, while relying on the robot's own sensors to avoid obstacles. The selection criterion of the optimal path depends on the potential energy error and the distance error of the molecules on the detected obstacles or targets, and guides the robot to move in this direction. In order to evaluate the effectiveness of the algorithm, a series of simulations were made in three different scenarios and the results were compared. The results show that the algorithm can effectively avoid falling into local minimum. At the same time, the algorithm proposed can provide a shorter and smoother path, and the operation is more simple.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于双容器的机器人路径规划随机化学反应算法
针对未知环境下移动机器人的路径规划问题,提出了一种基于双容器的随机化学反应算法。新算法受到细菌觅食算法的启发,采用了一种基于机器人周围随机分布的化学分子的策略,这些分子搜索到目标位置的最佳路径,同时依靠机器人自身的传感器避开障碍物。最优路径的选择准则取决于分子在检测到的障碍物或目标上的势能误差和距离误差,并引导机器人朝这个方向运动。为了评估算法的有效性,在三种不同的场景下进行了一系列的仿真,并对结果进行了比较。结果表明,该算法能有效避免陷入局部极小。同时,该算法可以提供更短、更平滑的路径,操作更简单。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evaluation method and decision support of network education based on association rules ACER: An adaptive context-aware ensemble regression model for airfare price prediction An improved constraint model for team tactical position selection in games Trust your wallet: A new online wallet architecture for Bitcoin An approach based on decision tree for analysis of behavior with combined cycle power plant
×
引用
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