Explore a map to find an optimal path from start to goal using classical search-based methods

ENPM661 Project 2: A point robot uses the Dijkstra search algorithm to find a goal node in a configuration space, while avoiding the obstacles in the map

Implementation of Dijkstra's algorithm to find a collision-free path for a point robot

Implementation of Dijkstra algorithm for robot path planning.

This repository implements A* and Dijkstra Algorithm for a point and rigid robot in a 2D obstacle environment

In this project, the Dijkstra's path planning algorithm was implemented on a point robot for helping it navigate through an obstacle filled space.

In this project, the A* path planning algorithm was implemented on a point robot for helping it navigate through an obstacle filled space.

Dijkstra Path Planning algorithm for Rigid and Point Robot