首页 /研究 /An Efficient Optimal Path Finding for Mobile Robot Based on Dijkstra Method
OTHER

An Efficient Optimal Path Finding for Mobile Robot Based on Dijkstra Method

Ali Alyasin, Eyad I. Abbas, Sundus D. Hasan

发表年份
2019
引用次数
32

摘要

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.

关键词

Dijkstra's algorithmShortest path problemMobile robotPathfindingComputer scienceRobotPython (programming language)Path (computing)Real-time computingMobile robot navigation

相关论文

查看 OTHER 分类全部论文