This repository contains the code for the planning homework task 1 of ME5413. This task is to implement a basic A* algorithm and improve it for this specific task. Based on that, we will solve the "Travelling Salesman Problem" (TSP).
HW3_Task1&2
├─ .gitignore
├─ Homework_3_Planning.pdf
├─ LICENSE
├─ README.md
├─ REFLECTIONS.md
├─ homework3.ipynb
├─ map
│ ├─ obstacle_map.npy
│ ├─ vivocity.png
│ ├─ vivocity_freespace.png
│ └─ vivocity_freespace_raw.png
├─ results
│ ├─ a_star
│ └─ dijkstra
└─ src
├─ extract_free_space.py
└─ planner
├─ a_star.py
├─ bfs.py
└─ dijkstra.py
This project uses code from the following sources: