Skip to content

Planning algorithms - BFS, DFS, Dijkstra’s, and A* implemented on a grid world environment of configurable obstacle density

Notifications You must be signed in to change notification settings

radhasaraf/RBE550-Motion-planning

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

27 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

RBE550-Motion-planning

Assignment: Flatland

Planning algorithms - Breadth first search, Depth first search, Dijkstra’s, and A* have been implemented on a grid world environment of configurable obstacle density.

Breadth First Search:

Breadth First Search

Depth First Search:

Depth First Search

Dijkstra's (diagonal steps allowed):

Dijkstra's

A*:

A*

Steps to run the code

  1. Add to your .bashrc

    export PYTHONPATH=/home/<user>/RBE550-Motion-planning/

  2. Create virtual env. and source it

    python3.9-venv -m venv venv

    source venv/bin/activate

  3. Install requirements:

    pip install -r requirements.txt

  4. Run path_planner.py

    python hw1/path_planner.py

About

Planning algorithms - BFS, DFS, Dijkstra’s, and A* implemented on a grid world environment of configurable obstacle density

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages