Analysis of Pure-pursuit Algorithm Parameters for Nonholonomic Mobile Robot Navigation in Unstructured and Confined Space

IF 0.6 Q3 MULTIDISCIPLINARY SCIENCES
Izzati Saleh, Azwati Azmin, Azan Yunus, Wan Rahiman
{"title":"Analysis of Pure-pursuit Algorithm Parameters for Nonholonomic Mobile Robot Navigation in Unstructured and Confined Space","authors":"Izzati Saleh, Azwati Azmin, Azan Yunus, Wan Rahiman","doi":"10.47836/pjst.32.1.06","DOIUrl":null,"url":null,"abstract":"This research analyses Pure-pursuit algorithm parameters for nonholonomic mobile robot navigation in unstructured and constrained space. The simulation-based experiment is limited to the mobile robot arrangement. The Look Ahead Distance parameter is adjusted so the mobile robot can navigate the predefined map closely following the waypoints. The optimal Look Ahead Distance value is combined with the VFH+ algorithm for obstacle avoidance. The method is enhanced by adding the λ weight so the robot returns to its waypoints after avoiding an obstacle. The investigation reveals that λ influences the mobile robot’s capacity to return to its predetermined waypoints after avoiding an obstacle. Based on the simulation experiment, the optimal LAD value is 0.2m, and the optimal λ value is 0.8.","PeriodicalId":46234,"journal":{"name":"Pertanika Journal of Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pertanika Journal of Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47836/pjst.32.1.06","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

Abstract

This research analyses Pure-pursuit algorithm parameters for nonholonomic mobile robot navigation in unstructured and constrained space. The simulation-based experiment is limited to the mobile robot arrangement. The Look Ahead Distance parameter is adjusted so the mobile robot can navigate the predefined map closely following the waypoints. The optimal Look Ahead Distance value is combined with the VFH+ algorithm for obstacle avoidance. The method is enhanced by adding the λ weight so the robot returns to its waypoints after avoiding an obstacle. The investigation reveals that λ influences the mobile robot’s capacity to return to its predetermined waypoints after avoiding an obstacle. Based on the simulation experiment, the optimal LAD value is 0.2m, and the optimal λ value is 0.8.
非结构受限空间非完整移动机器人导航的纯追踪算法参数分析
研究了非完整移动机器人在非结构化约束空间中导航的纯追踪算法参数。基于仿真的实验仅限于移动机器人的布置。调整前瞻距离参数,以便移动机器人可以在预定义的地图上紧跟航路点导航。将最优前瞻距离值与VFH+算法相结合进行避障。该方法通过添加λ权重来增强,以便机器人在避开障碍物后返回其路径点。研究表明,λ会影响移动机器人在避开障碍物后返回预定路径点的能力。仿真实验表明,最优LAD值为0.2m,最优λ值为0.8。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Pertanika Journal of Science and Technology
Pertanika Journal of Science and Technology MULTIDISCIPLINARY SCIENCES-
CiteScore
1.50
自引率
16.70%
发文量
178
期刊介绍: Pertanika Journal of Science and Technology aims to provide a forum for high quality research related to science and engineering research. Areas relevant to the scope of the journal include: bioinformatics, bioscience, biotechnology and bio-molecular sciences, chemistry, computer science, ecology, engineering, engineering design, environmental control and management, mathematics and statistics, medicine and health sciences, nanotechnology, physics, safety and emergency management, and related fields of study.
×
引用
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学术官方微信