Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/27646
Title: | Parallelization of Dijkstra’s Algorithm for Robot Motion Planning: Is It Worth Increasing Speed Without Losing Accuracy? | Authors: | Josifoski, Darko Gushev, Marjan Zdraveski, Vladimir Ristov, Sashko |
Keywords: | Dijkstra’s Algorithm, robotics, robot motion planning, parallel processing | Issue Date: | 15-Nov-2022 | Publisher: | IEEE | Conference: | 2022 30th Telecommunications Forum (TELFOR) | Abstract: | This paper examines the problem of parallelizing Dijkstra’s algorithm, as an algorithm for robot motion planning was a challenge to twist the algorithm in such a way so it can be executed in parallel, rather than sequentially. In this paper, we test the validity of a research hypothesis that the speed of Dijkstra’s algorithm can be increased by parallelizing and keeping the same accuracy. The developed use-case of Dijkstra’s algorithm as a robot motion planning algorithm was tested against performance, both in execution speed and accuracy. Finally, we elaborate on the benefits of this parallelizing approach. | URI: | http://hdl.handle.net/20.500.12188/27646 |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.