A* Path Planner
An implementation of A* path planning for autonomous mobile robots, finding efficient collision-free routes through mapped environments.
What I did
- Implemented the A* search algorithm to plan optimal paths across occupancy grid maps.
- Handled obstacle avoidance and tuned heuristics to balance path quality against planning time.
- Visualised planned paths to verify behaviour across different environments.
What I took away
- A working understanding of graph-search planning and its role in robot autonomy stacks.
- Experience turning an algorithm from theory into robust, testable code.
The code is on GitHub.