Implementasi Perencanaan Jalur menggunakan Algoritma Dijkstra pada Robot Roda Mecanum
Abstract
This research develops a robot capable of moving from a starting point to a destination as well as avoiding collisions using Dijkstra's algorithm, which is effective in finding the shortest path. This algorithm is implemented on a mecanum robot equipped with an Arduino microcontroller, mini PC, battery, DC motor with encoder, motor driver, and related software. This study tested five maps with the same starting point and destination, but with different obstacle locations. The test results showed that the mecanum robot managed to find the path and avoid obstacles well. With an average maximum speed of 2.6 m/s, the robot can cover a distance of 3.2 meters without obstacles in 14.96 seconds, and a distance of 4.2 meters with obstacles in 22.82 seconds. This research demonstrates the potential of Dijkstra's algorithm in path planning and robot navigation, and underscores the importance of using the right hardware and software to achieve optimal performance. These results can serve as a basis for further development in the field of robotics, particularly in the application of autonomous robots in dynamic environments.
Downloads
References
C. Wang and J. Mao, “Summary of AGV Path Planning,” in 2019 3rd International Conference on Electronic Information Technology and Computer Engineering (EITCE), IEEE, Oct. 2019, pp. 332–335. doi: 10.1109/EITCE47263.2019.9094825.
Y. Li, Z. Huang, and Y. Xie, “Path planning of mobile robot based on improved genetic algorithm,” Proc. - 2020 3rd Int. Conf. Electron Device Mech. Eng. ICEDME 2020, pp. 691–695, 2020, doi: 10.1109/ICEDME50972.2020.00163.
M. N. A. Wahab, C. M. Lee, M. F. Akbar, and F. H. Hassan, “Path Planning for Mobile Robot Navigation in Unknown Indoor Environments Using Hybrid PSOFS Algorithm,” IEEE Access, vol. 8, pp. 161805–161815, 2020, doi: 10.1109/ACCESS.2020.3021605.
U. Orozco-Rosas, K. Picos, and O. Montiel, “Hybrid Path Planning Algorithm Based on Membrane Pseudo-Bacterial Potential Field for Autonomous Mobile Robots,” IEEE Access, vol. 7, pp. 156787–156803, 2019, doi: 10.1109/ACCESS.2019.2949835.
H. Zhao, Z. Nie, F. Zhou, and S. Lu, “A Compound Path Planning Algorithm for Mobile Robots,” Proc. 2021 IEEE Int. Conf. Power Electron. Comput. Appl. ICPECA 2021, pp. 541–545, 2021, doi: 10.1109/ICPECA51329.2021.9362724.
Y. Jiang et al., “Path Planning for Mobile Robots Based on Improved RRT Algorithm,” ICARM 2022 - 2022 7th IEEE Int. Conf. Adv. Robot. Mechatronics, pp. 793–798, 2022, doi: 10.1109/ICARM54641.2022.9959538.
W. Andriani, “Perbandingan Algoritma Dijkstra dan Algoritma Floyd-Warshall Penentuan Jalur Lintasan Terpendek Stasiun Tegal Menuju Hotel,” BATIRSI-Bahari Tek. Inform. dan …, vol. 4, no. 2, pp. 1–8, 2021, [Online]. Available: https://e-journal.stmik-tegal.ac.id/index.php/batirsi/article/view/42
A. Alyasin, E. I. Abbas, and S. D. Hasan, “An Efficient Optimal Path Finding for Mobile Robot Based on Dijkstra Method,” 4th Sci. Int. Conf. Najaf, SICN 2019, pp. 11–14, 2019, doi: 10.1109/SICN47020.2019.9019345.
Q. Liu, H. Xu, L. Wang, J. Chen, Y. Li, and L. Xu, “Application of Dijkstra algorithm in path planning for geomagnetic navigation,” Proc. IEEE Sens. Array Multichannel Signal Process. Work., vol. 2020-June, pp. 19–22, 2020, doi: 10.1109/SAM48682.2020.9104382.
Y. Xu, Y. Zhao, and S. L. Zhao, “Grid Line Tracking Omnidirectional Robot Based on Visible Light Sensor and Mecanum Wheel PID Control,” Proc. - 2021 7th Int. Symp. Mechatronics Ind. Informatics, ISMII 2021, pp. 57–60, 2021, doi: 10.1109/ISMII52409.2021.00019.
G. Rahmatillah and B. Suprianto, “Sistem Pengendalian Kecepatan Motor DC Pada Prototipe Lift Menggunakan Kontroler Pi Berbasis Arduino,” J. Tek. Elektro, vol. 9, no. 2, pp. 269–276, 2020.
M. Fikri and M. Rivai, “Sistem Penghindar Halangan dengan Metode Lidar pada Unmanned Surface Vehicle,” J. Tek. ITS, vol. 8, no. 2, pp. 127–132, 2020, doi: 10.12962/j23373539.v8i2.43153.
E. C. Orozco-Magdaleno, F. Gomez-Bravo, E. Castillo-Castaneda, and G. Carbone, “Evaluation of Locomotion Performances for a Mecanum-Wheeled Hybrid Hexapod Robot,” IEEE/ASME Trans. Mechatronics, vol. 26, no. 3, pp. 1657–1667, 2021, doi: 10.1109/TMECH.2020.3027259.
L. Qiong, C. Xudong, H. Jizhuang, and M. Ruihao, “Research on robot path planning method based on tangent intersection method,” Proc. - 2020 Int. Conf. Inf. Sci. Parallel Distrib. Syst. ISPDS 2020, pp. 272–276, 2020, doi: 10.1109/ISPDS51347.2020.00063.
H. Huang et al., “Dynamic path planning based on improved D∗ algorithms of Gaode map,” Proc. 2019 IEEE 3rd Inf. Technol. Networking, Electron. Autom. Control Conf. ITNEC 2019, no. Itnec, pp. 1121–1124, 2019, doi: 10.1109/ITNEC.2019.8729438.
Y. Ding, H. Ma, and S. Li, “Path Planning of Omnidirectional Mobile Vehicle Based on Road Condition,” Proc. 2019 IEEE Int. Conf. Mechatronics Autom. ICMA 2019, pp. 1425–1429, 2019, doi: 10.1109/ICMA.2019.8816402.
Z. Nie and H. Zhao, “Research on Robot Path Planning Based on Dijkstra and Ant Colony Optimization,” in 2019 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS), IEEE, Nov. 2019, pp. 222–226. doi: 10.1109/ICIIBMS46890.2019.8991502.
H. Liu, L. Huang, and H. Ye, “Autonomous path planning strategy for water-Air amphibious vehicle based on improved A* algorithm,” IEEE Int. Conf. Ind. Informatics, vol. 2020-July, pp. 812–816, 2020, doi: 10.1109/INDIN45582.2020.9442090.
Wu J, Ma X, Peng T, Wang H. An Improved Timed Elastic Band (TEB) Algorithm of Autonomous Ground Vehicle (AGV) in Complex Environment. Sensors. 2021; 21(24):8312. https://doi.org/10.3390/s21248312
F. Fahmizal, A. Priyatmoko, and A. Mayub, “Implementasi Kinematika Trajectory Lingkaran pada Robot Roda Mecanum,” J. List. Instrumentasi dan Elektron. Terap., vol. 3, no. 1, pp. 25–30, 2022, doi: 10.22146/juliet.v3i1.74760.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) ) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Open Access Policy
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.
Its free availability on the public internet, permitting any users to read, download, copy, distribute, print, search, or link to the full texts of these articles, crawl them for indexing, pass them as data to software, or use them for any other lawful purpose, without financial, legal, or technical barriers other than those inseparable from gaining access to the internet itself.