A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots

Autonomous Mobile Robots (AMRs) are frequently used in many fields of technology. In this study, an AMR was designed to execute different path planning algorithms. Firstly, working principle, system architecture and motion planning of AMR are presented. Then, a map for the current environment is pro...

Full description

Saved in:
Bibliographic Details
Main Authors: Orkan Murat Çelik, Murat Köseoğlu
Format: Article
Language:English
Published: Çanakkale Onsekiz Mart University 2023-03-01
Series:Journal of Advanced Research in Natural and Applied Sciences
Subjects:
Online Access:https://dergipark.org.tr/en/download/article-file/2441714
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832095504037576704
author Orkan Murat Çelik
Murat Köseoğlu
author_facet Orkan Murat Çelik
Murat Köseoğlu
author_sort Orkan Murat Çelik
collection DOAJ
description Autonomous Mobile Robots (AMRs) are frequently used in many fields of technology. In this study, an AMR was designed to execute different path planning algorithms. Firstly, working principle, system architecture and motion planning of AMR are presented. Then, a map for the current environment is produced by a Robot Operating System (ROS) powered AMR which was designed for this study. The AMR locates itself on the produced map with the aid of an integrated Light Detection and Ranging sensor (LIDAR). The locomotion of AMR to a user-defined target on the produced map is performed by an optimal path based on AMR's own navigation plan. Two different path planning algorithms, which are Dijkstra’s algorithm and a modified version of Dijkstra’s algorithm, are executed on a cost-effective AMR platform, which has the capability of Simultaneous Localization and Mapping (SLAM). The reason why Dijkstra algorithm is handled in this study rather than A*, D* and RRT algorithms is that this algorithm is a basic and widely used algorithm. Dijkstra’s algorithm is modified, and pros and cons of the modified algorithm are analysed compared to Dijkstra algorithm. The proposed algorithm and navigation of AMR are testedboth in real time in real world and as a simulation in Gazebo. Two algorithms were compared according to the results obtained from the robot locomotion both in real application and simulation environment. It is observed that the modified version of the Dijkstra’s algorithm comparatively yielded a bit more satisfactory results in the aspect of path planning.
format Article
id doaj-art-bbfe24dc00a74202bb2bf44281aabed9
institution Kabale University
issn 2757-5195
language English
publishDate 2023-03-01
publisher Çanakkale Onsekiz Mart University
record_format Article
series Journal of Advanced Research in Natural and Applied Sciences
spelling doaj-art-bbfe24dc00a74202bb2bf44281aabed92025-02-05T17:57:34ZengÇanakkale Onsekiz Mart UniversityJournal of Advanced Research in Natural and Applied Sciences2757-51952023-03-019120521710.28979/jarnas.1119957453A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile RobotsOrkan Murat Çelik0https://orcid.org/0000-0001-7231-1711Murat Köseoğlu1https://orcid.org/0000-0003-3774-1083HAVELSAN Hava Elektronik Sanayi AŞ.İnönü ÜniversitesiAutonomous Mobile Robots (AMRs) are frequently used in many fields of technology. In this study, an AMR was designed to execute different path planning algorithms. Firstly, working principle, system architecture and motion planning of AMR are presented. Then, a map for the current environment is produced by a Robot Operating System (ROS) powered AMR which was designed for this study. The AMR locates itself on the produced map with the aid of an integrated Light Detection and Ranging sensor (LIDAR). The locomotion of AMR to a user-defined target on the produced map is performed by an optimal path based on AMR's own navigation plan. Two different path planning algorithms, which are Dijkstra’s algorithm and a modified version of Dijkstra’s algorithm, are executed on a cost-effective AMR platform, which has the capability of Simultaneous Localization and Mapping (SLAM). The reason why Dijkstra algorithm is handled in this study rather than A*, D* and RRT algorithms is that this algorithm is a basic and widely used algorithm. Dijkstra’s algorithm is modified, and pros and cons of the modified algorithm are analysed compared to Dijkstra algorithm. The proposed algorithm and navigation of AMR are testedboth in real time in real world and as a simulation in Gazebo. Two algorithms were compared according to the results obtained from the robot locomotion both in real application and simulation environment. It is observed that the modified version of the Dijkstra’s algorithm comparatively yielded a bit more satisfactory results in the aspect of path planning.https://dergipark.org.tr/en/download/article-file/2441714amrdijkstra algorithmpath planningrobot navigationros
spellingShingle Orkan Murat Çelik
Murat Köseoğlu
A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
Journal of Advanced Research in Natural and Applied Sciences
amr
dijkstra algorithm
path planning
robot navigation
ros
title A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
title_full A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
title_fullStr A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
title_full_unstemmed A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
title_short A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
title_sort modified dijkstra algorithm for ros based autonomous mobile robots
topic amr
dijkstra algorithm
path planning
robot navigation
ros
url https://dergipark.org.tr/en/download/article-file/2441714
work_keys_str_mv AT orkanmuratcelik amodifieddijkstraalgorithmforrosbasedautonomousmobilerobots
AT muratkoseoglu amodifieddijkstraalgorithmforrosbasedautonomousmobilerobots
AT orkanmuratcelik modifieddijkstraalgorithmforrosbasedautonomousmobilerobots
AT muratkoseoglu modifieddijkstraalgorithmforrosbasedautonomousmobilerobots