/A_star_and_Hybrid_A_star

Given a graph, having a start node and an end node with obstacles, Astar find the optimal path, if it exists, joining the start to goal node. Hybrid Astar takes vehicle dynamics into consideration and generates a smoother path which the vehicle can follow. Both the implementations are optimized using dictionaries and heaps

Primary LanguagePython

This repository is not active