基于改进a星算法的爬壁机器人圆柱形储罐检测路径规划

Jiameng Xue, Jie Li, Jingyu Chen, Chunlei Tu, A. Stancu, Xingsong Wang
{"title":"基于改进a星算法的爬壁机器人圆柱形储罐检测路径规划","authors":"Jiameng Xue, Jie Li, Jingyu Chen, Chunlei Tu, A. Stancu, Xingsong Wang","doi":"10.1109/FENDT54151.2021.9749634","DOIUrl":null,"url":null,"abstract":"Wall-climbing robots have been widely developed in the application of storage tank inspection. One of the significant issues in robot tank inspection is how to determine an optimal path for the robot from an initial position to the destination. A-star algorithm is a first search algorithm commonly used in robotics path planning, whereas it may suffer from some drawbacks, for example, there are some redundant points could be removed from the generated path and some sharp turns need to be smoother for the robot to track with. As a result, a modified A-star algorithm is proposed in this paper to optimize the generated path. The simulation results show that the number of way points is decreased and the sharp turns in the path are removed. Therefore, this modified algorithm can provide a more efficient path planning with smoother curves and shorter operation time compared with normal method, without losing the optimization.","PeriodicalId":425658,"journal":{"name":"2021 IEEE Far East NDT New Technology & Application Forum (FENDT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Wall-climbing Robot Path Planning for Cylindrical Storage Tank Inspection Based on Modified A-star Algorithm\",\"authors\":\"Jiameng Xue, Jie Li, Jingyu Chen, Chunlei Tu, A. Stancu, Xingsong Wang\",\"doi\":\"10.1109/FENDT54151.2021.9749634\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wall-climbing robots have been widely developed in the application of storage tank inspection. One of the significant issues in robot tank inspection is how to determine an optimal path for the robot from an initial position to the destination. A-star algorithm is a first search algorithm commonly used in robotics path planning, whereas it may suffer from some drawbacks, for example, there are some redundant points could be removed from the generated path and some sharp turns need to be smoother for the robot to track with. As a result, a modified A-star algorithm is proposed in this paper to optimize the generated path. The simulation results show that the number of way points is decreased and the sharp turns in the path are removed. Therefore, this modified algorithm can provide a more efficient path planning with smoother curves and shorter operation time compared with normal method, without losing the optimization.\",\"PeriodicalId\":425658,\"journal\":{\"name\":\"2021 IEEE Far East NDT New Technology & Application Forum (FENDT)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Far East NDT New Technology & Application Forum (FENDT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FENDT54151.2021.9749634\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Far East NDT New Technology & Application Forum (FENDT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FENDT54151.2021.9749634","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

爬壁机器人在储罐检测中得到了广泛的应用。如何确定机器人从初始位置到目的地的最优路径是机器人储罐检测中的一个重要问题。a -star算法是机器人路径规划中常用的一种首搜索算法,但该算法存在一些缺陷,如生成的路径中存在一些冗余点可以被去除,一些急转弯需要使机器人的跟踪更加平滑。因此,本文提出了一种改进的a -star算法来优化生成的路径。仿真结果表明,该方法减少了路径点的数量,消除了路径上的急转弯。因此,与常规方法相比,改进后的算法可以提供更有效的路径规划,曲线更平滑,运行时间更短,同时又不会失去优化效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Wall-climbing Robot Path Planning for Cylindrical Storage Tank Inspection Based on Modified A-star Algorithm
Wall-climbing robots have been widely developed in the application of storage tank inspection. One of the significant issues in robot tank inspection is how to determine an optimal path for the robot from an initial position to the destination. A-star algorithm is a first search algorithm commonly used in robotics path planning, whereas it may suffer from some drawbacks, for example, there are some redundant points could be removed from the generated path and some sharp turns need to be smoother for the robot to track with. As a result, a modified A-star algorithm is proposed in this paper to optimize the generated path. The simulation results show that the number of way points is decreased and the sharp turns in the path are removed. Therefore, this modified algorithm can provide a more efficient path planning with smoother curves and shorter operation time compared with normal method, without losing the optimization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信