EPL-PRM:窄通道中概率路线图规划者的等势线抽样策略

Run Yang , Jingru Li , Zhikun Jia , Sen Wang , Huan Yao , Erbao Dong
{"title":"EPL-PRM:窄通道中概率路线图规划者的等势线抽样策略","authors":"Run Yang ,&nbsp;Jingru Li ,&nbsp;Zhikun Jia ,&nbsp;Sen Wang ,&nbsp;Huan Yao ,&nbsp;Erbao Dong","doi":"10.1016/j.birob.2023.100112","DOIUrl":null,"url":null,"abstract":"<div><p>Path planning is a crucial concern in the field of mobile robotics, particularly in complex scenarios featuring narrow passages. Sampling-based planners, such as the widely utilized probabilistic roadmap (PRM), have been extensively employed in various robot applications. However, PRM’s utilization of random node sampling often results in disconnected graphs, posing a significant challenge when dealing with narrow passages. In order to tackle this issue, we present equipotential line sampling strategy for probabilistic roadmap (EPL-PRM), a novel approach derived from PRM. This paper initially proposes a sampling potential field, followed by the construction of equipotential lines that are denser in the proximity of obstacles and narrow passages. Random sampling is subsequently conducted along these lines. Consequently, the sampling strategy enhances the likelihood of sampling nodes around obstacles and narrow passages, thereby addressing the issue of sparsity encountered in traditional sampling-based planners. Furthermore, we introduce a nodal optimization method based on an artificial repulsive field, which prompts sampled nodes to move in the direction of repulsion. As a result, nodes around obstacles are distributed more uniformly, while nodes within narrow passages gravitate toward the middle of the passages. Finally, extensive simulations are conducted to evaluate the proposed method. The results demonstrate that our approach achieves path planning with superior efficiency, lower cost, and higher reliability compared with traditional algorithms.</p></div>","PeriodicalId":100184,"journal":{"name":"Biomimetic Intelligence and Robotics","volume":"3 3","pages":"Article 100112"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"EPL-PRM: Equipotential line sampling strategy for probabilistic roadmap planners in narrow passages\",\"authors\":\"Run Yang ,&nbsp;Jingru Li ,&nbsp;Zhikun Jia ,&nbsp;Sen Wang ,&nbsp;Huan Yao ,&nbsp;Erbao Dong\",\"doi\":\"10.1016/j.birob.2023.100112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Path planning is a crucial concern in the field of mobile robotics, particularly in complex scenarios featuring narrow passages. Sampling-based planners, such as the widely utilized probabilistic roadmap (PRM), have been extensively employed in various robot applications. However, PRM’s utilization of random node sampling often results in disconnected graphs, posing a significant challenge when dealing with narrow passages. In order to tackle this issue, we present equipotential line sampling strategy for probabilistic roadmap (EPL-PRM), a novel approach derived from PRM. This paper initially proposes a sampling potential field, followed by the construction of equipotential lines that are denser in the proximity of obstacles and narrow passages. Random sampling is subsequently conducted along these lines. Consequently, the sampling strategy enhances the likelihood of sampling nodes around obstacles and narrow passages, thereby addressing the issue of sparsity encountered in traditional sampling-based planners. Furthermore, we introduce a nodal optimization method based on an artificial repulsive field, which prompts sampled nodes to move in the direction of repulsion. As a result, nodes around obstacles are distributed more uniformly, while nodes within narrow passages gravitate toward the middle of the passages. Finally, extensive simulations are conducted to evaluate the proposed method. The results demonstrate that our approach achieves path planning with superior efficiency, lower cost, and higher reliability compared with traditional algorithms.</p></div>\",\"PeriodicalId\":100184,\"journal\":{\"name\":\"Biomimetic Intelligence and Robotics\",\"volume\":\"3 3\",\"pages\":\"Article 100112\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Biomimetic Intelligence and Robotics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2667379723000268\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biomimetic Intelligence and Robotics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2667379723000268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

路径规划是移动机器人领域的一个关键问题,尤其是在通道狭窄的复杂场景中。基于采样的规划者,如广泛使用的概率路线图(PRM),已被广泛应用于各种机器人应用中。然而,PRM对随机节点采样的利用经常导致图的断开,这在处理窄通道时带来了重大挑战。为了解决这一问题,我们提出了概率路线图的等电位线采样策略(EPL-PRM),这是一种从PRM派生的新方法。本文首先提出了一个采样电势场,然后在障碍物和狭窄通道附近构建更密集的等电位线。随后沿着这些线路进行随机采样。因此,采样策略提高了在障碍物和狭窄通道周围采样节点的可能性,从而解决了传统基于采样的规划者中遇到的稀疏性问题。此外,我们还介绍了一种基于人工排斥场的节点优化方法,该方法促使采样节点沿排斥方向移动。因此,障碍物周围的节点分布更加均匀,而狭窄通道内的节点则倾向于通道的中间。最后,对所提出的方法进行了广泛的仿真评估。结果表明,与传统算法相比,该方法实现了高效、低成本、高可靠性的路径规划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
EPL-PRM: Equipotential line sampling strategy for probabilistic roadmap planners in narrow passages

Path planning is a crucial concern in the field of mobile robotics, particularly in complex scenarios featuring narrow passages. Sampling-based planners, such as the widely utilized probabilistic roadmap (PRM), have been extensively employed in various robot applications. However, PRM’s utilization of random node sampling often results in disconnected graphs, posing a significant challenge when dealing with narrow passages. In order to tackle this issue, we present equipotential line sampling strategy for probabilistic roadmap (EPL-PRM), a novel approach derived from PRM. This paper initially proposes a sampling potential field, followed by the construction of equipotential lines that are denser in the proximity of obstacles and narrow passages. Random sampling is subsequently conducted along these lines. Consequently, the sampling strategy enhances the likelihood of sampling nodes around obstacles and narrow passages, thereby addressing the issue of sparsity encountered in traditional sampling-based planners. Furthermore, we introduce a nodal optimization method based on an artificial repulsive field, which prompts sampled nodes to move in the direction of repulsion. As a result, nodes around obstacles are distributed more uniformly, while nodes within narrow passages gravitate toward the middle of the passages. Finally, extensive simulations are conducted to evaluate the proposed method. The results demonstrate that our approach achieves path planning with superior efficiency, lower cost, and higher reliability compared with traditional algorithms.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.80
自引率
0.00%
发文量
0
期刊最新文献
An improved path planning and tracking control method for planetary exploration rovers with traversable tolerance Human-in-the-loop transfer learning in collision avoidance of autonomous robots Forward solution algorithm of Fracture reduction robots based on Newton-Genetic algorithm SoftGrasp: Adaptive grasping for dexterous hand based on multimodal imitation learning Fuzzy adaptive variable impedance control on deformable shield of defecation smart care robot
×
引用
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