Indoor Robot Path Planning Based on an Improved Probabilistic Road Map Method

Jinfeng Lv, Jianwei Ma, Xiaojing Li
{"title":"Indoor Robot Path Planning Based on an Improved Probabilistic Road Map Method","authors":"Jinfeng Lv, Jianwei Ma, Xiaojing Li","doi":"10.1145/3375998.3376010","DOIUrl":null,"url":null,"abstract":"Aiming at indoor robot path planning, an improved probabilistic road map method is proposed to decide feasible routes for robots. Firstly, the proposed method sets nodes around the obstacles on the map randomly. By connecting starting point, nodes, and ending point, multi alternative practical routes which are not in collision with obstacles can be acquired. Secondly, this paper tries to optimize a route by eliminating unnecessary nodes and repositioning the nodes between starting point and ending point. Finally, the route with the shortest distance and the minimum number of inflection points is chosen as the best route. Experimental results show that, compared with other path planning methods, the improved probabilistic road map method can generate high quality routes rapidly and stably.","PeriodicalId":395773,"journal":{"name":"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 8th International Conference on Networks, Communication and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3375998.3376010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Aiming at indoor robot path planning, an improved probabilistic road map method is proposed to decide feasible routes for robots. Firstly, the proposed method sets nodes around the obstacles on the map randomly. By connecting starting point, nodes, and ending point, multi alternative practical routes which are not in collision with obstacles can be acquired. Secondly, this paper tries to optimize a route by eliminating unnecessary nodes and repositioning the nodes between starting point and ending point. Finally, the route with the shortest distance and the minimum number of inflection points is chosen as the best route. Experimental results show that, compared with other path planning methods, the improved probabilistic road map method can generate high quality routes rapidly and stably.
基于改进概率路线图法的室内机器人路径规划
针对室内机器人路径规划问题,提出了一种改进的概率路径图方法来确定机器人的可行路径。首先,该方法在地图上的障碍物周围随机设置节点。通过连接起点、节点和终点,可以获得不与障碍物碰撞的多备选实用路线。其次,通过消除不必要的节点,重新定位起点和终点之间的节点,对路径进行优化。最后选取距离最短、拐点数量最少的路径作为最佳路径。实验结果表明,与其他路径规划方法相比,改进的概率路线图方法能够快速、稳定地生成高质量的路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信