Implementation of Dijkstra's algorithm on a point robot

This repository contains code to find path between start position and goal position for a point robot using Dijkstra's path-planning algorithm.

The action set for this project is:

Required libraries

1. NumPy
2. OpenCV
3. copy

Instructions to run the code

python dijkstra.py

Video output "dijkstra" will be generated in the result folder.

Node exploration

Generated path