GitHub - hzfmax/AStarGridSearch: Created a 2D map discretized into a grid of square cells that can be blocked, unblocked, or partially blocked in Python. Computed the optimal path from a start node to a goal node using a heuristic search algorithm called A*.

hzfmax / AStarGridSearch Public

forked from szeplovitch95/AStarGridSearch

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Created a 2D map discretized into a grid of square cells that can be blocked, unblocked, or partially blocked in Python. Computed the optimal path from a start node to a goal node using a heuristic search algorithm called A*.

1 star 2 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
.idea		.idea
__pycache__		__pycache__
maps		maps
final_report.pdf		final_report.pdf
final_report.tex		final_report.tex
main.py		main.py
main.pyc		main.pyc
map_generator.py		map_generator.py
map_statifier.py		map_statifier.py
project.pdf		project.pdf
results.json		results.json
searchalgorithms.py		searchalgorithms.py