GitHub - jvirdi2/A_star_and_Hybrid_A_star: Given a graph, A* finds the optimal path, if it exists, joining the start node to the goal node. Hybrid A* takes vehicle dynamics into consideration and generates a smoother path which the vehicle can follow. Both the implementations are optimized using dictionaries & heaps

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
a_star_case_1.png		a_star_case_1.png
a_star_case_2.png		a_star_case_2.png
a_star_case_3.png		a_star_case_3.png
a_star_case_4.png		a_star_case_4.png
a_star_optimised.py		a_star_optimised.py
hybrid_a_star_case_1.png		hybrid_a_star_case_1.png
hybrid_a_star_case_2.png		hybrid_a_star_case_2.png
hybrid_a_star_case_3.png		hybrid_a_star_case_3.png
hybrid_a_star_case_4.png		hybrid_a_star_case_4.png
hybrid_a_star_optimised.py		hybrid_a_star_optimised.py

About

Given a graph, A* finds the optimal path, if it exists, joining the start node to the goal node. Hybrid A* takes vehicle dynamics into consideration and generates a smoother path which the vehicle can follow. Both the implementations are optimized using dictionaries & heaps

astar-algorithm motion-planning hybrid-a-star bicycle-model