基于Dijkstra方法的移动机器人高效最优寻径

Ali Alyasin, E. Abbas, Sundus D. Hasan
{"title":"基于Dijkstra方法的移动机器人高效最优寻径","authors":"Ali Alyasin, E. Abbas, Sundus D. Hasan","doi":"10.1109/SICN47020.2019.9019345","DOIUrl":null,"url":null,"abstract":"This paper introduces a smart mobile robot for tracking an optimal path road network. The development of smart mobile robots became more useful and an efficient in a wide range of areas. Therefore, the proposed system was designed by using a microcontroller type Raspberry Pi 3 with associate the Python language and implemented on the a known road networks based on Dijkstra’s algorithm to choosing the best path to reach the target by the smart mobile robot. The Dijkstra’s algorithm has putted a solution for shortest length between two nodes in the graphic search. The experimental results were taken from the gradient training by Dijkstra’s algorithm for obtain path set out. These results appeared a high accuracy to select the shortest path for robot moving. The mobile robot closed path for reach to the target in the shortest possible time and minimum weight and less expensive.","PeriodicalId":179575,"journal":{"name":"2019 4th Scientific International Conference Najaf (SICN)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"An Efficient Optimal Path Finding for Mobile Robot Based on Dijkstra Method\",\"authors\":\"Ali Alyasin, E. Abbas, Sundus D. Hasan\",\"doi\":\"10.1109/SICN47020.2019.9019345\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a smart mobile robot for tracking an optimal path road network. The development of smart mobile robots became more useful and an efficient in a wide range of areas. Therefore, the proposed system was designed by using a microcontroller type Raspberry Pi 3 with associate the Python language and implemented on the a known road networks based on Dijkstra’s algorithm to choosing the best path to reach the target by the smart mobile robot. The Dijkstra’s algorithm has putted a solution for shortest length between two nodes in the graphic search. The experimental results were taken from the gradient training by Dijkstra’s algorithm for obtain path set out. These results appeared a high accuracy to select the shortest path for robot moving. The mobile robot closed path for reach to the target in the shortest possible time and minimum weight and less expensive.\",\"PeriodicalId\":179575,\"journal\":{\"name\":\"2019 4th Scientific International Conference Najaf (SICN)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 4th Scientific International Conference Najaf (SICN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SICN47020.2019.9019345\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 4th Scientific International Conference Najaf (SICN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SICN47020.2019.9019345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

本文介绍了一种用于跟踪最优路径路网的智能移动机器人。智能移动机器人的发展在广泛的领域变得更加有用和高效。因此,本系统采用树莓派3型微控制器,结合Python语言进行设计,并基于Dijkstra算法在已知的道路网络上实现智能移动机器人选择到达目标的最佳路径。Dijkstra算法给出了图形搜索中两个节点之间最短长度的解。实验结果来自Dijkstra算法的梯度训练,以获得路径设置。这些结果对机器人运动的最短路径选择具有较高的精度。该移动机器人的闭合路径能够在最短的时间内以最小的重量和较低的成本到达目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Optimal Path Finding for Mobile Robot Based on Dijkstra Method
This paper introduces a smart mobile robot for tracking an optimal path road network. The development of smart mobile robots became more useful and an efficient in a wide range of areas. Therefore, the proposed system was designed by using a microcontroller type Raspberry Pi 3 with associate the Python language and implemented on the a known road networks based on Dijkstra’s algorithm to choosing the best path to reach the target by the smart mobile robot. The Dijkstra’s algorithm has putted a solution for shortest length between two nodes in the graphic search. The experimental results were taken from the gradient training by Dijkstra’s algorithm for obtain path set out. These results appeared a high accuracy to select the shortest path for robot moving. The mobile robot closed path for reach to the target in the shortest possible time and minimum weight and less expensive.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信