Implementation of Improved Artificial Potential Field Path Planning Algorithm in Differential Drive Mobile Robot

R. Puriyanto, O. Wahyunggoro, A. Cahyadi
{"title":"Implementation of Improved Artificial Potential Field Path Planning Algorithm in Differential Drive Mobile Robot","authors":"R. Puriyanto, O. Wahyunggoro, A. Cahyadi","doi":"10.1109/ICITEE56407.2022.9954079","DOIUrl":null,"url":null,"abstract":"An autonomous mobile robot (AMR) with wheel drive is one of the most widely developed applications today. Navigation ability, especially path planning, is one of the problems faced in AMR development. One of the path planning algorithms that is considered reliable and can be implemented in real-time is the artificial potential field (APF). However, the weakness of APF is that the robot can be trapped in the minimum locale. The local minimums commonly encountered are goal non-reachable due to nearby obstacles (GNRON) and symmetrically aligned robot obstacle goals (SAROG). This study aims to develop an APF-based path planning algorithm to solve the local minimum problem. The Gompertz function and the cone-shaped potential field are used in the Improved APF (IAPF) algorithm. The IAPF algorithm is also implemented in the kinematic equation of a wheeled mobile robot with a differential drive type. The results show that the IAPF algorithm can be implemented in a differential drive type robot. The robot can avoid obstacles in the form of SAROG and GNRON and go to the goal with an error to the goal $(d_{rg})$ less than the tolerance value of 5%.","PeriodicalId":246279,"journal":{"name":"2022 14th International Conference on Information Technology and Electrical Engineering (ICITEE)","volume":"272 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 14th International Conference on Information Technology and Electrical Engineering (ICITEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITEE56407.2022.9954079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

An autonomous mobile robot (AMR) with wheel drive is one of the most widely developed applications today. Navigation ability, especially path planning, is one of the problems faced in AMR development. One of the path planning algorithms that is considered reliable and can be implemented in real-time is the artificial potential field (APF). However, the weakness of APF is that the robot can be trapped in the minimum locale. The local minimums commonly encountered are goal non-reachable due to nearby obstacles (GNRON) and symmetrically aligned robot obstacle goals (SAROG). This study aims to develop an APF-based path planning algorithm to solve the local minimum problem. The Gompertz function and the cone-shaped potential field are used in the Improved APF (IAPF) algorithm. The IAPF algorithm is also implemented in the kinematic equation of a wheeled mobile robot with a differential drive type. The results show that the IAPF algorithm can be implemented in a differential drive type robot. The robot can avoid obstacles in the form of SAROG and GNRON and go to the goal with an error to the goal $(d_{rg})$ less than the tolerance value of 5%.
改进人工势场路径规划算法在差动驱动移动机器人中的实现
具有轮驱动的自主移动机器人(AMR)是当今最广泛发展的应用之一。导航能力,特别是路径规划,是自动驾驶汽车发展中面临的问题之一。人工势场(artificial potential field, APF)是一种被认为是可靠的、可以实时实现的路径规划算法。然而,APF的缺点是机器人可能被困在最小的区域。通常遇到的局部最小值是由于附近障碍物而无法到达的目标(GNRON)和对称对齐的机器人障碍目标(SAROG)。本研究旨在开发一种基于apf的路径规划算法来解决局部最小问题。改进的APF (IAPF)算法采用了Gompertz函数和锥形势场。并将该算法应用于差动驱动轮式移动机器人的运动学方程中。结果表明,IAPF算法可以在差动驱动型机器人中实现。机器人可以避开SAROG和GNRON形式的障碍物,到达目标时对目标$(d_{rg})$的误差小于公差值5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信