Application of Improved A* algorithm in Mobile Robot Path Planning

Zunshi Song, Liang Yuan
{"title":"Application of Improved A* algorithm in Mobile Robot Path Planning","authors":"Zunshi Song, Liang Yuan","doi":"10.1109/ISASS.2019.8757742","DOIUrl":null,"url":null,"abstract":"A* algorithm has lots of extended nodes, which will raises the amount of calculation. This paper presents Improved A* algorithm, which can reduces the amount of calculation by reducing the number of extended nodes. Improved A* algorithm adds one parameter which is the cost from the previous point to the final point in the valuation function, which will greatly reduces the number of nodes and improved algorithm efficiency. For the sake of proving the effectiveness of improved algorithm, simulation software and wheeled mobile robot are used for experiment. The experiments result show that our algorithm can greatly reduce the number of nodes.","PeriodicalId":359959,"journal":{"name":"2019 3rd International Symposium on Autonomous Systems (ISAS)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 3rd International Symposium on Autonomous Systems (ISAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISASS.2019.8757742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A* algorithm has lots of extended nodes, which will raises the amount of calculation. This paper presents Improved A* algorithm, which can reduces the amount of calculation by reducing the number of extended nodes. Improved A* algorithm adds one parameter which is the cost from the previous point to the final point in the valuation function, which will greatly reduces the number of nodes and improved algorithm efficiency. For the sake of proving the effectiveness of improved algorithm, simulation software and wheeled mobile robot are used for experiment. The experiments result show that our algorithm can greatly reduce the number of nodes.
改进A*算法在移动机器人路径规划中的应用
A*算法有很多扩展节点,这会增加计算量。本文提出了改进的A*算法,该算法通过减少扩展节点的数量来减少计算量。改进的A*算法在估值函数中增加了一个参数,即从前一个点到最后一个点的代价,这将大大减少节点数量,提高算法效率。为了验证改进算法的有效性,利用仿真软件和轮式移动机器人进行了实验。实验结果表明,该算法可以大大减少节点数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信