IAD Index of Academic Documents
  • Home Page
  • About
    • About Izmir Academy Association
    • About IAD Index
    • IAD Team
    • IAD Logos and Links
    • Policies
    • Contact
  • Submit A Journal
  • Submit A Conference
  • Submit Paper/Book
    • Submit a Preprint
    • Submit a Book
  • Contact
  • Journal of Advanced Research in Natural and Applied Sciences
  • Volume:9 Issue:1
  • A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots

A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots

Authors : Orkan Murat ÇELİK, Murat KÖSEOĞLU
Pages : 205-217
Doi:10.28979/jarnas.1119957
View : 16 | Download : 14
Publication Date : 2023-03-06
Article Type : Research Paper
Abstract :Autonomous Mobile Robots insert ignore into journalissuearticles values(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 insert ignore into journalissuearticles values(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 insert ignore into journalissuearticles values(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 insert ignore into journalissuearticles values(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 tested both 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.
Keywords : AMR, dijkstra algorithm, path planning, Robot Navigation, ROS

ORIGINAL ARTICLE URL
VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.


Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2025