Skip to content

Noor1886/Obstacle_Avoidance_using_Dijkstra

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Obstacle_Planning_using_Dijkstra

Problem Statement

For a given mobile robtot, We have to navigate through an obstacle Loaded graph and find the optimal path using Dijkstra Algorithm.

Screenshot from 2023-03-05 02-26-00

How to run the code?

To run the code you should be having the pygame library for visualization. Change the Location to root directory and type in python3 "file-name".py It will prompt you to enter the coordinates of the initial and final positions and will notify you if it lies in obstacle sapce.

Obstacle map

The Dimensions are shown below and a clearnace of 5mm us used arounf the obstaclle space Screenshot from 2023-03-05 02-30-00

Result

Releases

No releases published

Packages

No packages published

Languages