FunGlobalPlannerByHamza

Global Path Planning Visualizer

Grid world with obstacles. Start (S) must reach Goal (G).
Choose a global planner and watch how it explores.

Algorithm Dijkstra
A* (Manhattan)
Greedy Best-First

Grid

20×30 grid. Start and Goal are fixed.
Obstacles are randomized (you can regenerate).

Status: waiting for you to click "Run planner".

Legend:

Free cell Obstacle

Frontier / Open set Visited

Final path S / G

Dijkstra → explores in all directions (cost only).
A* → uses cost + heuristic (f = g + h).
Greedy → heuristic only (h), can get "lost".