Proceedings of the 7th International Conference on Applied Engineering (ICAE 2024)

<Previous Article In Volume
Next Article In Volume>

Path Planning Application using Dijkstra Algorithm on Service Robot

Authors
Ryan Satria Wijaya1, *, Arya Mahendra1, Senanjung Prayoga1, Anugerah Wibisana1
1Politeknik Negeri Batam, Batam Kepulauan Riau, 29461, Indonesia
*Corresponding author. Email: ryan@polibatam.ac.id
Corresponding Author
Ryan Satria Wijaya
Available Online 25 December 2024.
DOI
10.2991/978-94-6463-620-8_20How to use a DOI?
Keywords
Path Planning; Robotics; Shortest Path Algorithm
Abstract

The advancement of robot technology in mobile robots is quickly evolving and being utilized in various sectors such as industries, military, medicine, and public services. Challenges consist of perception, localization, motion control, and path planning. The aim of Dijkstra’s algorithm, which is a greedy algorithm, is to optimize path planning to improve movement efficiency. Dijkstra’s algorithm is a useful method in graph theory to find the shortest path between two nodes in a weighted graph, utilizing an iterative approach to compute the distance. The algorithm being suggested speeds up the initial process by simultaneously determining the shortest route from the starting point to all other points, utilizing various paths or continuing on the same path to reach additional nodes. Nonetheless, it begins at the central node, utilizing data that is not influenced by the route taken. The author experimented with Dijkstra’s algorithm using a Service Robot, successfully navigating past three obstacles without any collisions. The robot demonstrated success in finding the shortest and fastest path by maintaining an average speed of 0.23 m/s and average errors of 0.021 meters on the x-axis and 0.017 meters on the y-axis.

Copyright
© 2024 The Author(s)
Open Access
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 7th International Conference on Applied Engineering (ICAE 2024)
Series
Advances in Engineering Research
Publication Date
25 December 2024
ISBN
978-94-6463-620-8
ISSN
2352-5401
DOI
10.2991/978-94-6463-620-8_20How to use a DOI?
Copyright
© 2024 The Author(s)
Open Access
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Cite this article

risenwbib
TY  - CONF
AU  - Ryan Satria Wijaya
AU  - Arya Mahendra
AU  - Senanjung Prayoga
AU  - Anugerah Wibisana
PY  - 2024
DA  - 2024/12/25
TI  - Path Planning Application using Dijkstra Algorithm on Service Robot
BT  - Proceedings of the  7th International Conference on Applied Engineering (ICAE 2024)
PB  - Atlantis Press
SP  - 262
EP  - 271
SN  - 2352-5401
UR  - https://doi.org/10.2991/978-94-6463-620-8_20
DO  - 10.2991/978-94-6463-620-8_20
ID  - Wijaya2024
ER  -