Developer · 2024
Mobile Robot Search Algorithms (A*, BFS, DFS)
Grid-based path-planning system implementing A*, BFS, and DFS with an interactive GUI for visualising environments, tuning parameters, and running batch experiments.
Overview
Grid-based path-planning system for a mobile robot, implementing A*, Breadth-First Search, and Depth-First Search. The project includes an interactive GUI for visualising environments, tuning parameters, and running batch experiments with automated result logging.
The question
Evaluate classical search algorithms under controlled conditions and compare performance trade-offs in navigation tasks with obstacles.
My approach
Built a discrete grid environment with configurable size and obstacle density, deterministic implementations of BFS, DFS, and heuristic-driven A*, and a Tkinter GUI for visual inspection, experiment control, and automated CSV export of results.
Outcome and limits
Fully functional cross-platform GUI with batch experiment runner, CSV export, and real-time path visualisation.
Results are specific to the project setup and data; broader use would require additional evaluation.
Interested in this work? Get in touch.