Performance Analysis of Probabilistic Roadmaps in Simulation for Mobile Robot Path Planning

Author(s)	Karthik Krishna Srivatsava Kon, Hari Deepak N, Anbarasi MP
Country	India
Abstract	Many challenges, including path-planning for a mobile robot, revolve around finding the lowest-cost path through a graph. A quick path-planning algorithm for a mobile robot in a dynamic environment is proposed by integrating Dijkstra's algorithm. Dijkstra's method and Probabilistic Roadmaps are used to determine an initial path from the starting point to the goal. This method searches for an optimal path from the robot's current location to this local target, and as the number of nodes increases, a new path that brings the robot from the current place to the goal is obtained. Meanwhile, the re-planning time is substantially reduced. The simulation results validate the suggested algorithm's feasibility and effectiveness.
Keywords	Path planning, dynamic environment, Dijkstra’s algorithm, Probabilistic Roadmaps
Field	Engineering
Published In	Volume 5, Issue 6, November-December 2023
Published On	2023-11-29
DOI	https://doi.org/10.36948/ijfmr.2023.v05i06.8160

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research