Path planning of robot using modified dijkstra Algorithm

The robot path planning and trajectory planning were studied and explored for many generations using algorithms. These studies explain to find most efficient path throughout the selected environment is really complicated. In this paper, different environments were created and the modified parameters in Dijkstra algorithm were implemented in a robot for finding an appropriate path for reaching the destination. The mobile robot model was developed using V-REP open-source simulation software and implemented the Dijkstra algorithm for identifying the sub-optimal and collision-free path. The simulated results were showing that the reduction method was effective in terms of time and velocity in the created environments for robot path planning