Path Planning of Six-wheel-drive Rescue Robot Based on A* Algorithm and Artificial Potential Field Method

Hongqian Zhao, Zhanshun Cheng
{"title":"Path Planning of Six-wheel-drive Rescue Robot Based on A* Algorithm and Artificial Potential Field Method","authors":"Hongqian Zhao, Zhanshun Cheng","doi":"10.1109/YAC57282.2022.10023654","DOIUrl":null,"url":null,"abstract":"In view of the rescue robot path planning under complicated environment and unknown disturbance failure problem, path planning of complex environment for rescue robot based on the improved Hybrid algorithm is proposed in this paperThe hybrid algorithm improves the traditional A* and introduces artificial potential field into A*. More and more reliable path planning algorithms need to be studied to ensure that the rescue robot can reach the rescue scene quickly, including the heuristic function H(n) is dynamically weighted, and redundant nodes in the path are removed. In my paper, the search speed of A* algorithm is improved by dynamically changing the weight size, the redundant nodes are eliminated to reduce the path length, and the APF is introduced to avoid obstacles to make the rescue robot reach the end point successfully and efficiently. We can see from the simulation results-the hybrid algorithm has better performance, the Search time reduced by 34.09%, the length is shortened by 5.75%, and the turning points are shortened by 36.28%. The results show that this method has obvious optimization effect and certain feasibility.","PeriodicalId":272227,"journal":{"name":"2022 37th Youth Academic Annual Conference of Chinese Association of Automation (YAC)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 37th Youth Academic Annual Conference of Chinese Association of Automation (YAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YAC57282.2022.10023654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In view of the rescue robot path planning under complicated environment and unknown disturbance failure problem, path planning of complex environment for rescue robot based on the improved Hybrid algorithm is proposed in this paperThe hybrid algorithm improves the traditional A* and introduces artificial potential field into A*. More and more reliable path planning algorithms need to be studied to ensure that the rescue robot can reach the rescue scene quickly, including the heuristic function H(n) is dynamically weighted, and redundant nodes in the path are removed. In my paper, the search speed of A* algorithm is improved by dynamically changing the weight size, the redundant nodes are eliminated to reduce the path length, and the APF is introduced to avoid obstacles to make the rescue robot reach the end point successfully and efficiently. We can see from the simulation results-the hybrid algorithm has better performance, the Search time reduced by 34.09%, the length is shortened by 5.75%, and the turning points are shortened by 36.28%. The results show that this method has obvious optimization effect and certain feasibility.
基于A*算法和人工势场法的六轮驱动救援机器人路径规划
针对复杂环境下救援机器人路径规划和未知干扰失效问题,提出了基于改进混合算法的救援机器人复杂环境路径规划。混合算法对传统的A*进行改进,在A*中引入人工势场。为了保证救援机器人能够快速到达救援现场,需要研究更多可靠的路径规划算法,包括对启发式函数H(n)进行动态加权,去除路径中的冗余节点。本文通过动态改变权值大小来提高A*算法的搜索速度,消除冗余节点以减少路径长度,并引入APF来避开障碍物,使救援机器人成功高效地到达终点。从仿真结果可以看出,混合算法具有更好的性能,搜索时间缩短34.09%,长度缩短5.75%,拐点缩短36.28%。结果表明,该方法具有明显的优化效果和一定的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信